Andreas Malcher

发表

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

Martin Kutrib, Andreas Malcher, 2009, Electron. Notes Theor. Comput. Sci..

Cellular automata with limited inter-cell bandwidth

Martin Kutrib, Andreas Malcher, 2011, Theor. Comput. Sci..

Descriptional Complexity of Pushdown Store Languages

Andreas Malcher, Katja Meckel, Carlo Mereghetti, 2012, J. Autom. Lang. Comb..

Transducing reversibly with finite state machines

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2019, Theor. Comput. Sci..

Descriptional Complexity of Pushdown Store Languages

Andreas Malcher, Katja Meckel, Carlo Mereghetti, 2012, DCFS.

One-Way Multi-Head Finite Automata with Pebbles But No States

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2013, Developments in Language Theory.

Queue Automata: Foundations and Developments

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, Reversibility and Universality.

Descriptional Complexity of Machines with Limited Resources

Andreas Malcher, Jonathan Goldstine, Hing Leung, 2002, J. Univers. Comput. Sci..

Transductions Computed by One-Dimensional Cellular Automata

Martin Kutrib, Andreas Malcher, 2012, AUTOMATA & JAC.

Report on DCFS 2019

Andreas Malcher, 2019, Bull. EATCS.

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, DCFS.

Real-time reversible iterative arrays

Martin Kutrib, Andreas Malcher, 2010, Theor. Comput. Sci..

Regulated nondeterminism in pushdown automata

Martin Kutrib, Andreas Malcher, Larissa Werlein, 2009, Theor. Comput. Sci..

Decidability questions for insertion systems

Andreas Malcher, 2017, NCMA.

One-way reversible multi-head finite automata

Martin Kutrib, Andreas Malcher, 2017, Theor. Comput. Sci..

Bounded Languages Meet Cellular Automata with Sparse Communication

Martin Kutrib, Andreas Malcher, 2009, DCFS.

A Hierarchy of Fast Reversible Turing Machines

Martin Kutrib, Andreas Malcher, Sebastian Jakobi, 2015, RC.

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

Martin Kutrib, Andreas Malcher, Markus Holzer, 2009, CSP.

Reversible Queue Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Fundam. Informaticae.

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2015, Int. J. Found. Comput. Sci..

On the Computational Capacity of Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2008, Developments in Language Theory.

Context-Dependent Nondeterminism for Pushdown Automata

Martin Kutrib, Andreas Malcher, 2006, Developments in Language Theory.

Measuring Communication in Cellular Automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, JAC.

Transductions Computed by Iterative Arrays

Martin Kutrib, Andreas Malcher, 2010, JAC.

Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Int. J. Found. Comput. Sci..

Regulated Nondeterminism in Pushdown Automata

Martin Kutrib, Andreas Malcher, Larissa Werlein, 2007, CIAA.

One-way reversible multi-head finite automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2012, Theor. Comput. Sci..

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

Andreas Malcher, 2003, Fundam. Informaticae.

Descriptional complexity of two-way pushdown automata with restricted head reversals

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2011, Theor. Comput. Sci..

Boosting Reversible Pushdown and Queue Machines by Preprocessing

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2020, Int. J. Found. Comput. Sci..

Minimizing finite automata is computationally hard

Andreas Malcher, Andreas Malcher, 2004, Theor. Comput. Sci..

Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2011, DCFS.

Cellular Automata and Discrete Complex Systems

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2015, Lecture Notes in Computer Science.

Iterative Arrays with Set Storage

Martin Kutrib, Andreas Malcher, 2014, J. Cell. Autom..

Logical Description of Structured and XML Languages

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2009, ICTCS.

Johann Wolfgang Goeth&-Universitat

Andreas Malcher, Andreas Malcher, 2009 .

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

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, J. Autom. Lang. Comb..

Input-Driven Multi-counter Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2019, CIAA.

Context-dependent nondeterminism for pushdown automata

Martin Kutrib, Andreas Malcher, 2007, Theor. Comput. Sci..

Reversible Pushdown Transducers

Martin Kutrib, Andreas Malcher, Luca Prigioniero, 2018, DLT.

The Boolean closure of linear context-free languages

Martin Kutrib, Andreas Malcher, Detlef Wotschke, 2007, Acta Informatica.

Beschreibungskomplexität von Zellularautomaten

Andreas Malcher, 2004 .

Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, ICTCS.

Input-Driven Double-Head Pushdown Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2017, AFL.

Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication

Andreas Malcher, 2018, Automata.

On Metalinear Parallel Communicating Grammar Systems

Andreas Malcher, Bettina Sunckel, 2007, Int. J. Found. Comput. Sci..

The Boolean Closure of Linear Context-Free Languages

Martin Kutrib, Andreas Malcher, Detlef Wotschke, 2004, Developments in Language Theory.

When input-driven pushdown automata meet reversiblity

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2015, RAIRO Theor. Informatics Appl..

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2013, CIAA.

Shrinking One-Way Cellular Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2015, Automata.

Measuring Communication in Automata Systems - (Invited Paper)

Martin Kutrib, Andreas Malcher, 2014, Developments in Language Theory.

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2015, Theor. Comput. Sci..

On the Expressive Power of FO[ + ]

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2010, LATA.

Complexity of multi-head finite automata: Origins and directions

Martin Kutrib, Andreas Malcher, Markus Holzer, 2011, Theor. Comput. Sci..

Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, CiE.

Regularity and Size of Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, DCFS.

Descriptional Complexity of Bounded Regular Languages

Martin Kutrib, Andreas Malcher, Andrea Herrmann, 2016, DCFS.

The Size of One-Way Cellular Automata

Martin Kutrib, Andreas Malcher, Jonas Lefèvre, 2010, Automata.

A Direct Construction of Finite State Automata for Pushdown Store Languages

Andreas Malcher, Katja Meckel, Carlo Mereghetti, 2013, DCFS.

Descriptional complexity of bounded context-free languages

Andreas Malcher, Giovanni Pighizzini, 2013, Inf. Comput..

Report from DCFS 2012

Andreas Malcher, 2012, Bull. EATCS.

Iterative arrays with finite inter-cell communication

Martin Kutrib, Andreas Malcher, 2020 .

Descriptional Complexity of Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, DCFS.

Cellular Automata and Discrete Complex Systems

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2013, Lecture Notes in Computer Science.

Remembering Chandra Kintala

Andreas Malcher, Detlef Wotschke, Martin Kappes, 2010, DCFS.

Stateless One-Way Multi-Head Finite Automata with Pebbles

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Int. J. Found. Comput. Sci..

Input-Driven Stack Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2012, IFIP TCS.

Automaten und Formale Sprachen

Martin Kutrib, Andreas Malcher, Markus Holzer, 2008 .

Report on DCFS 2018

Andreas Malcher, 2018, Bull. EATCS.

On the Descriptional Complexity of Iterative Arrays

Andreas Malcher, 2004, IEICE Trans. Inf. Syst..

Input-Driven Queue Automata with Internal Transductions

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, LATA.

Sublinearly Space Bounded Iterative Arrays

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2010, Int. J. Found. Comput. Sci..

Fast reversible language recognition using cellular automata

Martin Kutrib, Andreas Malcher, 2007, Inf. Comput..

Shrinking one-way cellular automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Natural Computing.

When Church-Rosser Becomes Context Free

Martin Kutrib, Andreas Malcher, 2007, Int. J. Found. Comput. Sci..

Descriptional Complexity of Splicing Systems

Andreas Malcher, Detlef Wotschke, Remco Loos, 2007, Int. J. Found. Comput. Sci..

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

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2012, Developments in Language Theory.

Two-Party Watson-Crick Computations

Martin Kutrib, Andreas Malcher, 2010, CIAA.

In Memoriam Chandra Kintala

Andreas Malcher, Detlef Wotschke, Martin Kappes, 2012, Int. J. Found. Comput. Sci..

Reversible Shrinking Two-Pushdown Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2016, LATA.

Cellular automata with sparse communication

Martin Kutrib, Andreas Malcher, 2010, Theor. Comput. Sci..

On two-way communication in cellular automata with a fixed number of cells

Andreas Malcher, Andreas Malcher, 2005, Theor. Comput. Sci..

First-order logics: some characterizations and closure properties

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2012, Acta Informatica.

Reversible pushdown automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, J. Comput. Syst. Sci..

Boosting Reversible Pushdown Machines by Preprocessing

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, RC.

Diving into the queue

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, NCMA.

20. Theorietag der GI-Fachgruppe "Automaten und Formale Sprachen''

Henrik Björklund, Artiom Alhazov, Rudolf Freund, 2010 .

Tinput-Driven Pushdown, Counter, and Stack Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2017, Fundam. Informaticae.

Cellular Automata with Sparse Communication

Martin Kutrib, Andreas Malcher, 2009, CIAA.

Descriptional Complexity of Cellular Automata and Decidability Questions

Andreas Malcher, 2001, DCFS.

Iterative Arrays with Finite Inter-cell Communication

Martin Kutrib, Andreas Malcher, 2019, Automata.

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2010, Int. J. Found. Comput. Sci..

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

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2007, Discret. Appl. Math..

The Size Impact of Little Iterative Array Resources

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2012, J. Cell. Autom..

Cellular String Generators

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2020, Automata.

Digging input-driven pushdown automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2019, NCMA.

Real-Time Reversible One-Way Cellular Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Automata.

Cellular automata and discrete complex systems : 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013, proceedings

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2013 .

On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata

Andreas Malcher, 2005, DCFS.

On pushdown store languages

Andreas Malcher, Katja Meckel, Carlo Mereghetti, 2012, ICTCS 2012.

Cellular Automata and Descriptional Complexity

Andreas Malcher, 2006, DCFS.

Head and state hierarchies for unary multi-head finite automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Acta Informatica.

Hierarchies and undecidability results for iterative arrays with sparse communication

Andreas Malcher, 2019, Natural Computing.

Boosting Pushdown and Queue Machines by Preprocessing

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, CIAA.

On the Computational Capacity of Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2008, Int. J. Found. Comput. Sci..

Preface

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2003, Adv. Robotics.

Descriptional Complexity of Bounded Regular Languages

Martin Kutrib, Andreas Malcher, Andrea Herrmann, 2017, J. Autom. Lang. Comb..

Computations and Decidability of Iterative Arrays with Restricted Communication

Martin Kutrib, Andreas Malcher, 2009, Parallel Process. Lett..

Extended Uniformly Limited T0L Languages and Mild Context-Sensitivity

Martin Kutrib, Andreas Malcher, Suna Bensch, 2016 .

Oblivious two-way finite automata: Decidability and complexity

Martin Kutrib, Andreas Malcher, Giovanni Pighizzini, 2014, Inf. Comput..

Real-Time Reversible Iterative Arrays

Martin Kutrib, Andreas Malcher, 2007, FCT.

Tinput-Driven Pushdown Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2015, MCU.

Descriptional Complexity of Bounded Context-Free Languages

Andreas Malcher, Giovanni Pighizzini, 2007, Developments in Language Theory.

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

Martin Kutrib, Andreas Malcher, 2006, IFIP TCS.

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2011, Int. J. Found. Comput. Sci..

One-Dimensional Cellular Automaton Transducers

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2013, Fundam. Informaticae.

Cellular Automata: Descriptional Complexity and Decidability

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2018, Reversibility and Universality.

Measuring Communication in Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2014, AFL.

Iterative Arrays: Little Resources Big Size Impact

Martin Kutrib, Andreas Malcher, 2012, ACRI.

Editorial

Andreas Malcher, Jürgen Dassow, 2009, J. Autom. Lang. Comb..

Finite Automata with Undirected State Graphs

Christian Schneider, Martin Kutrib, Andreas Malcher, 2018, DCFS.

Size of Unary One-Way Multi-head Finite Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2013, DCFS.

Fast One-Way Cellular Automata with Reversible Mealy Cells

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2017, AUTOMATA.

Transducing Reversibly with Finite State Machines

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2017, CIAA.

Reversible pushdown automata

Martin Kutrib, Andreas Malcher, 2012, J. Comput. Syst. Sci..

Deterministic Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Developments in Language Theory.

Simulations of Unary One-Way Multi-Head Finite Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Int. J. Found. Comput. Sci..

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

Martin Kutrib, Andreas Malcher, 2006, MFCS.

String Generation by Cellular Automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2021, Complex Syst..

Finite automata with undirected state graphs

Martin Kutrib, Andreas Malcher, Christian Schneider, 2021 .

Preface to Martin Kutrib Festschrift

Henning Fernau, Andreas Malcher, Giovanni Pighizzini, 2021, Acta Informatica.

Input-driven multi-counter automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2021, Theor. Comput. Sci..

Decidability Questions for Insertion Systems and Related Models

Andreas Malcher, 2021, Fundam. Informaticae.

Reversible pushdown transducers

Martin Kutrib, Andreas Malcher, Luca Prigioniero, 2021, Inf. Comput..