Andreas Malcher

Acta Informatica, 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

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]

Markus Holzer

Theor. Comput. Sci., 2011

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.

[BibT_eX]

[DOI]

Henning Bordihn

Int. J. Found. Comput. Sci., 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

Sublinearly Space Bounded Iterative Arrays.

[BibT_eX]

[DOI]

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

Remembering Chandra Kintala

[BibT_eX]

[DOI]

Martin Kappes

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Two-Party Watson-Crick Computations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

On the Expressive Power of FO[ + ].

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 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

2009

Regulated nondeterminism in pushdown automata.

[BibT_eX]

[DOI]

Larissa Werlein

Theor. Comput. Sci., 2009

Computations and Decidability of Iterative Arrays with Restricted Communication.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

Editorial.

[BibT_eX]

[DOI]

Jürgen Dassow

J. Autom. Lang. Comb., 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

Logical Description of Structured and XML Languages.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Descriptional Complexity of Splicing Systems.

[BibT_eX]

[DOI]

Remco Loos

Int. J. Found. Comput. Sci., 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]

Markus Holzer

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

The Boolean closure of linear context-free languages.

[BibT_eX]

[DOI]

Acta Informatica, 2008

Recent results on iterative arrays with small space bounds.

[BibT_eX]

Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 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

On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

On Metalinear Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

Bettina Sunckel

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

When Church-Rosser Becomes Context Free.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

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

Cellular Automata and Descriptional Complexity.

[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 two-way communication in cellular automata with a fixed number of cells.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Beschreibungskomplexität von Zellularautomaten.

[BibT_eX]

[DOI]

PhD thesis, 2004

Minimizing finite automata is computationally hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On the Descriptional Complexity of Iterative Arrays.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2004

2003

On One-Way Cellular Automata with a Fixed Number of Cells.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

2002

Descriptional Complexity of Machines with Limited Resources.

[BibT_eX]

[DOI]

Jonathan Goldstine

Martin Kappes

Chandra M. R. Kintala

Hing Leung

J. Univers. Comput. Sci., 2002

Descriptional Complexity of Cellular Automata and Decidability Questions.

[BibT_eX]

[DOI]