Andreas Malcher

According to our database1, Andreas Malcher authored at least 120 papers between 2001 and 2018.

Collaborative distances :
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Boosting Pushdown and Queue Machines by Preprocessing.
Proceedings of the Implementation and Application of Automata, 2018

Finite Automata with Undirected State Graphs.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

Queue Automata: Foundations and Developments.
Proceedings of the Reversibility and Universality, 2018

Cellular Automata: Descriptional Complexity and Decidability.
Proceedings of the Reversibility and Universality, 2018

Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017
One-way reversible multi-head finite automata.
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

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

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

Decidability questions for insertion systems.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 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

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

Boosting Reversible Pushdown Machines by Preprocessing.
Proceedings of the Reversible Computation - 8th International Conference, 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

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

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities.
Int. J. Found. Comput. Sci., 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

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

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

2014
Preface.
J. Cellular Automata, 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

Reversible queue automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata 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

Real-Time Reversible 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
Descriptional complexity of bounded context-free languages.
Inf. Comput., 2013

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

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.
Proceedings of the Implementation and Application of Automata, 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

A Direct Construction of Finite State Automata for Pushdown Store Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Descriptional complexity of two-way pushdown automata with restricted head reversals.
Theor. Comput. Sci., 2012

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

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

Descriptional Complexity of Pushdown Store Languages.
Journal of Automata, Languages and Combinatorics, 2012

In Memoriam Chandra Kintala.
Int. J. Found. Comput. Sci., 2012

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

Report from DCFS 2012.
Bulletin of the EATCS, 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

First-order logics: some characterizations and closure properties.
Acta Inf., 2012

One-Way Reversible Multi-head Finite Automata.
Proceedings of the Reversible Computation, 4th International Workshop, 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

Descriptional Complexity of Pushdown Store Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 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

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

Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals.
Proceedings of the Descriptional Complexity of Formal Systems, 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

Sublinearly Space Bounded Iterative Arrays.
Int. J. Found. Comput. Sci., 2010

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

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

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

On the Expressive Power of FO[ + ].
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

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

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

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

Editorial.
Journal of Automata, Languages and Combinatorics, 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

Descriptional complexity of bounded context-free languages
CoRR, 2009

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

Logical Description of Structured and XML Languages.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
Descriptional Complexity of Splicing Systems.
Int. J. Found. Comput. Sci., 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

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

Recent results on iterative arrays with small space bounds.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

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

Sublinearly Space Bounded Iterative Arrays.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

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

On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata.
Journal of Automata, Languages and Combinatorics, 2007

On Metalinear Parallel Communicating Grammar Systems.
Int. J. Found. Comput. Sci., 2007

When Church-Rosser Becomes Context Free.
Int. J. Found. Comput. Sci., 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

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

Descriptional Complexity of Bounded Context-Free Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Descriptional Complexity of Splicing Systems.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

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

Cellular Automata and Descriptional Complexity.
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.
Theor. Comput. Sci., 2005

On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Beschreibungskomplexität von Zellularautomaten.
PhD thesis, 2004

Minimizing finite automata is computationally hard.
Theor. Comput. Sci., 2004

On the Descriptional Complexity of Iterative Arrays.
IEICE Transactions, 2004

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

2003
On One-Way Cellular Automata with a Fixed Number of Cells.
Fundam. Inform., 2003

Minimizing Finite Automata Is Computationally Hard.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

On Two-Way Communication in Cellular Automata With a Fixed Number of Cells.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
Descriptional Complexity of Machines with Limited Resources.
J. UCS, 2002

Descriptional Complexity of Cellular Automata and Decidability Questions.
Journal of Automata, Languages and Combinatorics, 2002

On One-Way Cellular Automata with a Fixed Number of Cells.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
Descriptional Complexity of Cellular Automata and Decidability Questions.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001


  Loading...