Martin Kutrib

Proceedings of the Implementation and Application of Automata, 2012

Input-Driven Stack Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2012

States and Heads Do Count for Unary Multi-head Finite Automata.

[BibT_eX]

[DOI]

Matthias Wendlandt

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

Iterative Arrays: Little Resources Big Size Impact.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2012

2011

Cellular automata with limited inter-cell bandwidth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Complexity of multi-head finite automata: Origins and directions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Hairpin Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

The Complexity of Regular(-like) Expressions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Descriptional and computational complexity of finite automata - A survey.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Decidability of operation problems for T0L languages and subclasses.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Computational Complexity of NURIKABE.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Gaining Power by Input Operations: Finite Automata and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

Nodes Connected by Path Languages.

[BibT_eX]

[DOI]

Ursula Leiter

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Nature-Based Problems in Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

2010

Cellular automata with sparse communication.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Real-time reversible iterative arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

One-Way Cellular Automata, Bounded Languages, and Minimal Communication.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2010

On Stateless Two-Pushdown Automata and Restarting Automata.

[BibT_eX]

[DOI]

Hartmut Messerschmidt

Int. J. Found. Comput. Sci., 2010

On stateless deterministic restarting automata.

[BibT_eX]

[DOI]

Hartmut Messerschmidt

Acta Informatica, 2010

Two-Party Watson-Crick Computations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 4th International Workshop, 2010

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2010

Transductions Computed by Iterative Arrays.

[BibT_eX]

[DOI]

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Measuring Communication in Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

The Size of One-Way Cellular Automata.

[BibT_eX]

[DOI]

Jonas Lefèvre

Proceedings of the Automata 2010, 2010

Descriptional Complexity - An Introductory Survey.

[BibT_eX]

Proceedings of the Scientific Applications of Language Methods., 2010

2009

Cellular Automata and Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Regulated nondeterminism in pushdown automata.

[BibT_eX]

[DOI]

Larissa Werlein

Theor. Comput. Sci., 2009

Determination of finite automata accepting subregular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Computations and Decidability of Iterative Arrays with Restricted Communication.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

Self-Assembling Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2009

Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

On input-revolving deterministic and nondeterministic finite automata.

[BibT_eX]

[DOI]

Inf. Comput., 2009

More on the Size of Higman-Haines Sets: Effective Constructions.

[BibT_eX]

[DOI]

Hermann Gruber

Fundam. Informaticae, 2009

On One-way One-bit O (One)-message Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on Cellular Automata and Discrete Complex Systems, 2009

Bounded Languages Meet Cellular Automata with Sparse Communication

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

On the Number of Membranes in Unary P Systems

[BibT_eX]

[DOI]

Rudolf Freund

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

On Measuring Non-Recursive Trade-Offs

[BibT_eX]

[DOI]

Hermann Gruber

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Descriptional and Computational Complexity of Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Undecidability of Operation Problems for T0L Languages and Subclasses.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Cellular Automata - A Computational Point of View.

[BibT_eX]

[DOI]

Proceedings of the New Developments in Formal Languages and Applications, 2008

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

[BibT_eX]

[DOI]

J. Cell. Autom., 2008

Optimal Simulations of Weak Restarting Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Succinct description of regular languages by weak restarting automata.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Fast reversible language recognition using cellular automata.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

The Boolean closure of linear context-free languages.

[BibT_eX]

[DOI]

Detlef Wotschke

Acta Informatica, 2008

Deterministic Input-Reversal and Input-Revolving Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of NFA to DFA Conversion of Subregular Language Families.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Real-time reversible language recognition by cellular automata.

[BibT_eX]

Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

2007

Context-dependent nondeterminism for pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The size of Higman-Haines sets.

[BibT_eX]

[DOI]

Hermann Gruber

Theor. Comput. Sci., 2007

Non-Recursive Trade-Offs for Deterministic Restarting Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

When Church-Rosser Becomes Context Free.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Context-Free Grammars with Linked Nonterminals.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Hybrid Extended Finite Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Cellular Devices and Unary Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Finite turns and the regular closure of linear context-free languages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Variable Complexity of Simple Programs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

The Size of Higman-Haines Sets.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On the descriptional complexity of finite automata with modified acceptance conditions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The phenomenon of non-recursive trade-offs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Unsolvability levels of operation problems for subclasses of context-free languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Revolving-Input Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Descriptional Complexity of Deterministic Restarting Automata.

[BibT_eX]

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.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

The Fault-Tolerant Early Bird Problem.

[BibT_eX]

[DOI]

Björn Fay

IEICE Trans. Inf. Syst., 2004

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Fast one-way cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Nondeterministic Descriptional Complexity Of Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Foreword.

[BibT_eX]

[DOI]

Maurice Margenstern

Hiroshi Umeo

Fundam. Informaticae, 2003

Space- and Time-Bounded Nondeterminism for Cellular Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dimension- and Time-Hierarchies for Small Time Bounds.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Deterministic Turing machines in the range between real-time and linear-time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Refining Nondeterminism Below Linear Time.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

On Interacting Automata with Limited Nondeterminism.

[BibT_eX]

[DOI]

Thomas Buchholz

Fundam. Informaticae, 2002

Massively parallel fault tolerant computations on syntactical patterns.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2002

State Complexity of Basic Operations on Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

String Transformation for n -Dimensional Image Compression.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

Unary Language Operations and Their Nondeterministic State Complexity.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Economy of Descriptions for Basic Constructions on Rational Transductions.

[BibT_eX]

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Improving Raster Image Run-Length Encoding Using Data Order.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2001

A Time Hierarchy for Bounded One-Way Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.

[BibT_eX]

[DOI]

Proceedings of the Machines, 2001

Automata arrays and context-free languages.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

2000

Massively Parallel Pattern Recognition with Link Failures.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Thomas Buchholz

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Real-Time Language Recognition by Alternating Cellular Automata.

[BibT_eX]

[DOI]

Thomas Buchholz