Martin Kutrib

According to our database1, Martin Kutrib
  • authored at least 232 papers between 1991 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Concatenation-free languages.
Theor. Comput. Sci., 2017

One-way reversible multi-head finite automata.
Theor. Comput. Sci., 2017

The chop of languages.
Theor. Comput. Sci., 2017

Shrinking one-way cellular automata.
Natural Computing, 2017

Descriptional Complexity of Bounded Regular Languages.
Journal of Automata, Languages and Combinatorics, 2017

Reversible Limited Automata.
Fundam. Inform., 2017

Tinput-Driven Pushdown, Counter, and Stack Automata.
Fundam. Inform., 2017

Input-Driven Double-Head Pushdown Automata.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

On the Descriptional Complexity of Operations on Semilinear Sets.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Transducing Reversibly with Finite State Machines.
Proceedings of the Implementation and Application of Automata, 2017

Reversible Nondeterministic Finite Automata.
Proceedings of the Reversible Computation - 9th International Conference, 2017

Self-verifying pushdown automata.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

Two-sided strictly locally testable languages.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

Operational State Complexity and Decidability of Jumping Finite Automata.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

One-Time Nondeterministic Computations.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Structure and Complexity of Some Subregular Language Families.
Proceedings of the Role of Theory in Computer Science, 2017

Fast One-Way Cellular Automata with Reversible Mealy Cells.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016
Iterative Arrays with Set Storage.
J. Cellular Automata, 2016

Preface.
Journal of Automata, Languages and Combinatorics, 2016

Editorial.
Journal of Automata, Languages and Combinatorics, 2016

When input-driven pushdown automata meet reversiblity.
RAIRO - Theor. Inf. and Applic., 2016

Set Automata.
Int. J. Found. Comput. Sci., 2016

Reversible Queue Automata.
Fundam. Inform., 2016

Deterministic Stack Transducers.
Proceedings of the Implementation and Application of Automata, 2016

The Degree of Irreversibility in Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2016

Boosting Reversible Pushdown Machines by Preprocessing.
Proceedings of the Reversible Computation - 8th International Conference, 2016

Expressive capacity of subregular expressions.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Diving into the queue.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Input-Driven Queue Automata with Internal Transductions.
Proceedings of the Language and Automata Theory and Applications, 2016

Reversible Shrinking Two-Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2016

Descriptional Complexity of Bounded Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

Cutting the Firing Squad Synchronization.
Proceedings of the Cellular Automata, 2016

2015
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties.
Theor. Comput. Sci., 2015

Preface.
Int. J. Found. Comput. Sci., 2015

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities.
Int. J. Found. Comput. Sci., 2015

Deterministic One-Way Turing Machines with Sublinear Space.
Fundam. Inform., 2015

Expressive Capacity of Concatenation Freeness.
Proceedings of the Implementation and Application of Automata, 2015

A Hierarchy of Fast Reversible Turing Machines.
Proceedings of the Reversible Computation - 7th International Conference, 2015

When input-driven pushdown automata meet reversibility.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Reversible and Irreversible Computations of Deterministic Finite-State Devices.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Reversible Limited Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Tinput-Driven Pushdown Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Minimal Reversible Deterministic Finite Automata.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

On Simulation Cost of Unary Limited Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Shrinking One-Way Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014
Preface.
J. Cellular Automata, 2014

Self-Assembling Pushdown Automata.
Journal of Automata, Languages and Combinatorics, 2014

Nonterminal Controlled String Assembling Systems.
Journal of Automata, Languages and Combinatorics, 2014

Bidirectional string assembling systems.
RAIRO - Theor. Inf. and Applic., 2014

Stateless One-Way Multi-Head Finite Automata with Pebbles.
Int. J. Found. Comput. Sci., 2014

Simulations of Unary One-Way Multi-Head Finite Automata.
Int. J. Found. Comput. Sci., 2014

Oblivious two-way finite automata: Decidability and complexity.
Inf. Comput., 2014

Measuring Communication in Parallel Communicating Finite Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Head and state hierarchies for unary multi-head finite automata.
Acta Inf., 2014

Parameterized Prefix Distance between Regular Languages.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Degrees of Reversibility for DFA and DPDA.
Proceedings of the Reversible Computation - 6th International Conference, 2014

Reversible queue automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy.
Proceedings of the Language and Automata Theory and Applications, 2014

Deterministic Set Automata.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Measuring Communication in Automata Systems - (Invited Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Regularity and Size of Set Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Complexity of Operation Problems.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

Aspects of Reversibility for Classical Automata.
Proceedings of the Computing with New Resources, 2014

Real-Time Reversible One-Way Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Complexity of One-Way Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Iterative Arrays with Set Storage.
Proceedings of the Cellular Automata, 2014

2013
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata.
Int. J. Found. Comput. Sci., 2013

One-Dimensional Cellular Automaton Transducers.
Fundam. Inform., 2013

Recent Trends in Descriptional Complexity of Formal Languages.
Bulletin of the EATCS, 2013

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.
Proceedings of the Implementation and Application of Automata, 2013

Time-Symmetric Machines.
Proceedings of the Reversible Computation - 5th International Conference, 2013

Deterministic one-way Turing machines with sublinear space bounds.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

One-Way Multi-Head Finite Automata with Pebbles But No States.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Size of Unary One-Way Multi-head Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Nondeterministic state complexity of star-free languages.
Theor. Comput. Sci., 2012

Reversible pushdown automata.
J. Comput. Syst. Sci., 2012

The Size Impact of Little Iterative Array Resources.
J. Cellular Automata, 2012

Editorial.
Journal of Automata, Languages and Combinatorics, 2012

String Assembling Systems.
RAIRO - Theor. Inf. and Applic., 2012

Non-deterministic cellular automata and languages.
Int. J. General Systems, 2012

The Magic Number Problem for Subregular Language Families.
Int. J. Found. Comput. Sci., 2012

On the Computational Capacity of Parallel Communicating Finite Automata.
Int. J. Found. Comput. Sci., 2012

Transductions Computed by One-Dimensional Cellular Automata
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2012

One-Way Reversible Multi-head Finite Automata.
Proceedings of the Reversible Computation, 4th International Workshop, 2012

Bidirectional String Assembling Systems.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Oblivious Two-Way Finite Automata: Decidability and Complexity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Input-Driven Stack Automata.
Proceedings of the Theoretical Computer Science, 2012

States and Heads Do Count for Unary Multi-head Finite Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata.
Proceedings of the Languages Alive, 2012

Iterative Arrays: Little Resources Big Size Impact.
Proceedings of the Cellular Automata, 2012

2011
Cellular automata with limited inter-cell bandwidth.
Theor. Comput. Sci., 2011

Complexity of multi-head finite automata: Origins and directions.
Theor. Comput. Sci., 2011

Hairpin Finite Automata.
Journal of Automata, Languages and Combinatorics, 2011

Editorial.
Journal of Automata, Languages and Combinatorics, 2011

The Complexity of Regular(-like) Expressions.
Int. J. Found. Comput. Sci., 2011

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.
Int. J. Found. Comput. Sci., 2011

Descriptional and computational complexity of finite automata - A survey.
Inf. Comput., 2011

Decidability of operation problems for T0L languages and subclasses.
Inf. Comput., 2011

Computational Complexity of NURIKABE.
Fundam. Inform., 2011

Preface.
Fundam. Inform., 2011

Nondeterministic State Complexity of Star-Free Languages.
Proceedings of the Implementation and Application of Automata, 2011

Gaining Power by Input Operations: Finite Automata and Beyond.
Proceedings of the Implementation and Application of Automata, 2011

String Assembling Systems.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

Nodes Connected by Path Languages.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Nature-Based Problems in Cellular Automata.
Proceedings of the Models of Computation in Context, 2011

The Chop of Languages.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
Cellular automata with sparse communication.
Theor. Comput. Sci., 2010

Real-time reversible iterative arrays.
Theor. Comput. Sci., 2010

One-Way Cellular Automata, Bounded Languages, and Minimal Communication.
Journal of Automata, Languages and Combinatorics, 2010

On Measuring Non-recursive Trade-Offs.
Journal of Automata, Languages and Combinatorics, 2010

On Stateless Two-Pushdown Automata and Restarting Automata.
Int. J. Found. Comput. Sci., 2010

The Magic Number Problem for Subregular Language Families
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

On stateless deterministic restarting automata.
Acta Inf., 2010

Two-Party Watson-Crick Computations.
Proceedings of the Implementation and Application of Automata, 2010

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction.
Proceedings of the Membrane Computing, 2010

Reversible Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2010

Transductions Computed by Iterative Arrays.
Proceedings of the Second Symposium on Cellular Automata "Journeacute;es Automates Cellulaires", 2010

Measuring Communication in Cellular Automata.
Proceedings of the Second Symposium on Cellular Automata "Journeacute;es Automates Cellulaires", 2010

The Complexity of Regular(-Like) Expressions.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

The Size of One-Way Cellular Automata.
Proceedings of the Automata 2010, 2010

Descriptional Complexity - An Introductory Survey.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Cellular Automata and Language Theory.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Regulated nondeterminism in pushdown automata.
Theor. Comput. Sci., 2009

Determination of finite automata accepting subregular languages.
Theor. Comput. Sci., 2009

Computations and Decidability of Iterative Arrays with Restricted Communication.
Parallel Processing Letters, 2009

Self-Assembling Finite Automata.
Journal of Automata, Languages and Combinatorics, 2009

Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity.
Int. J. Found. Comput. Sci., 2009

On input-revolving deterministic and nondeterministic finite automata.
Inf. Comput., 2009

More on the Size of Higman-Haines Sets: Effective Constructions.
Fundam. Inform., 2009

On One-way One-bit O (One)-message Cellular Automata.
Electr. Notes Theor. Comput. Sci., 2009

Bounded Languages Meet Cellular Automata with Sparse Communication
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

On the Number of Membranes in Unary P Systems
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

On Measuring Non-Recursive Trade-Offs
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Cellular Automata with Sparse Communication.
Proceedings of the Implementation and Application of Automata, 2009

On Stateless Deterministic Restarting Automata.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Descriptional and Computational Complexity of Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Undecidability of Operation Problems for T0L Languages and Subclasses.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
Cellular Automata - A Computational Point of View.
Proceedings of the New Developments in Formal Languages and Applications, 2008

Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies.
J. Cellular Automata, 2008

Optimal Simulations of Weak Restarting Automata.
Int. J. Found. Comput. Sci., 2008

Succinct description of regular languages by weak restarting automata.
Inf. Comput., 2008

Fast reversible language recognition using cellular automata.
Inf. Comput., 2008

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

The Boolean closure of linear context-free languages.
Acta Inf., 2008

Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity.
Proceedings of the Implementation and Applications of Automata, 2008

Deterministic Input-Reversal and Input-Revolving Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

On the Computational Capacity of Parallel Communicating Finite Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

State Complexity of NFA to DFA Conversion of Subregular Language Families.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Real-time reversible language recognition by cellular automata.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

On Stateless Two-Pushdown Automata and Restarting Automata.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Context-dependent nondeterminism for pushdown automata.
Theor. Comput. Sci., 2007

The size of Higman-Haines sets.
Theor. Comput. Sci., 2007

Non-Recursive Trade-Offs for Deterministic Restarting Automata.
Journal of Automata, Languages and Combinatorics, 2007

When Church-Rosser Becomes Context Free.
Int. J. Found. Comput. Sci., 2007

Context-Free Grammars with Linked Nonterminals.
Int. J. Found. Comput. Sci., 2007

Hybrid Extended Finite Automata.
Int. J. Found. Comput. Sci., 2007

Cellular Devices and Unary Languages.
Fundam. Inform., 2007

Finite turns and the regular closure of linear context-free languages.
Discrete Applied Mathematics, 2007

Regulated Nondeterminism in Pushdown Automata.
Proceedings of the Implementation and Application of Automata, 2007

More on the Size of Higman-Haines Sets: Effective Constructions.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Succinct Description of Regular Languages by Weak Restarting Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Fast Reversible Language Recognition Using Cellular Automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Real-Time Reversible Iterative Arrays.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Hairpin Finite Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Optimal Simulations of Weak Restarting Automata.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2006
Variable Complexity of Simple Programs.
Fundam. Inform., 2006

Hybrid Extended Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Context-Dependent Nondeterminism for Pushdown Automata.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

The Size of Higman-Haines Sets.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
On the descriptional power of heads, counters, and pebbles.
Theor. Comput. Sci., 2005

On the descriptional complexity of finite automata with modified acceptance conditions.
Theor. Comput. Sci., 2005

The phenomenon of non-recursive trade-offs.
Int. J. Found. Comput. Sci., 2005

Unsolvability levels of operation problems for subclasses of context-free languages.
Int. J. Found. Comput. Sci., 2005

Revolving-Input Finite Automata.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Descriptional Complexity of Deterministic Restarting Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Economy of Description for Basic Constructions on Rational Transductions.
Journal of Automata, Languages and Combinatorics, 2004

Foreword.
IEICE Transactions, 2004

The Fault-Tolerant Early Bird Problem.
IEICE Transactions, 2004

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2004

Register Complexity of LOOP-, WHILE-, and GOTO-Programs.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

The Boolean Closure of Linear Context-Free Languages.
Proceedings of the Developments in Language Theory, 2004

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.
Proceedings of the Developments in Language Theory, 2004

The Phenomenon of Non-Recursive Trade-Offs.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003
Fast one-way cellular automata.
Theor. Comput. Sci., 2003

Nondeterministic Descriptional Complexity Of Regular Languages.
Int. J. Found. Comput. Sci., 2003

Foreword.
Fundam. Inform., 2003

Space- and Time-Bounded Nondeterminism for Cellular Automata.
Fundam. Inform., 2003

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dimension- and Time-Hierarchies for Small Time Bounds.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

On the Descriptional Power of Heads, Counters, and Pebbles.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
Deterministic Turing machines in the range between real-time and linear-time.
Theor. Comput. Sci., 2002

Refining Nondeterminism Below Linear Time.
Journal of Automata, Languages and Combinatorics, 2002

On Interacting Automata with Limited Nondeterminism.
Fundam. Inform., 2002

Massively parallel fault tolerant computations on syntactical patterns.
Future Generation Comp. Syst., 2002

State Complexity of Basic Operations on Nondeterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2002

String Transformation for n -Dimensional Image Compression.
Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

Unary Language Operations and Their Nondeterministic State Complexity.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Economy of Descriptions for Basic Constructions on Rational Transductions.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

Self-Assembling Finite Automata.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Improving Raster Image Run-Length Encoding Using Data Order.
Proceedings of the Implementation and Application of Automata, 2001

A Time Hierarchy for Bounded One-Way Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.
Proceedings of the Machines, 2001

Refining Nondeterminism below Linear-Time.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

Automata arrays and context-free languages.
Proceedings of the Where Mathematics, 2001

2000
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Electronic Colloquium on Computational Complexity (ECCC), 2000

Massively Parallel Pattern Recognition with Link Failures.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Iterative Arrays with Small Time Bounds.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Real-Time Language Recognition by Alternating Cellular Automata.
Proceedings of the Theoretical Computer Science, 2000

Iterative Arrays With Limited Nondeterministic Communication Cell.
Proceedings of the International Colloquium on Words, 2000

Fault Tolerant Parallel Pattern Recognition.
Proceedings of the Theoretical and Practical Issues on Cellular Automata, 2000

1999
Pushdown Cellular Automata.
Theor. Comput. Sci., 1999

On time reduction and simulation in cellular spaces.
Int. J. Comput. Math., 1999

Iterative Arrays with a Wee Bit Alternation.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On tally languages and generalized interacting automata.
Proceedings of the Developments in Language Theory, 1999

1998
On Time Computability of Functions in One-Way Cellular Automata.
Acta Inf., 1998

One Guess One-Way Cellular Arrays.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Introduction to the Special Issue on Cellular Automata.
Parallel Computing, 1997

Some Relations Between Massively Parallel Arrays.
Parallel Computing, 1997

On the power of one-way bounded cellular time computers.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
On Relations between Arrays of Processing Elements of Different Dimensionality.
Proceedings of the Parcella 1996, 1996

1995
The Firing Squad Synchronization Problem in Defective Cellular Automata.
IEICE Transactions, 1995

Real-Time One-Way Pushdown Cellular Automata Languages.
Proceedings of the Developments in Language Theory II, 1995

1994
Investigation of Different Input Modes for Cellular Automata.
Proceedings of the Parcella 1994, 1994

1993
Kellererweiterte Polyautomaten.
PhD thesis, 1993

1991
Minimal Time Synchronization in Restricted Defective Cellular Automata.
Elektronische Informationsverarbeitung und Kybernetik, 1991


  Loading...