Descriptional Complexity of Cellular Automata and Decidability Questions. - Andreas Malcher (J. Autom. Lang. Comb., 2002)

Descriptional Complexity of Machines with Limited Resources. - Jonathan Goldstine; Martin Kappes; Chandra M. R. Kintala; Hing Leung; Andreas Malcher; Detlef Wotschke (J. Univers. Comput. Sci., 2002)

On One-Way Cellular Automata with a Fixed Number of Cells. - Andreas Malcher (Fundam. Informaticae, 2003)

On the Descriptional Complexity of Iterative Arrays. - Andreas Malcher (IEICE Trans. Inf. Syst., 2004)

Minimizing finite automata is computationally hard. - Andreas Malcher (Theor. Comput. Sci., 2004)

Beschreibungskomplexität von Zellularautomaten. - Andreas Malcher (2004)

On two-way communication in cellular automata with a fixed number of cells. - Andreas Malcher (Theor. Comput. Sci., 2005)

Cellular Automata and Descriptional Complexity. - Andreas Malcher (DCFS, 2006)

Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. - Martin Kutrib; Andreas Malcher (IFIP TCS, 2006)

Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. - Martin Kutrib; Andreas Malcher (MFCS, 2006)

Finite turns and the regular closure of linear context-free languages. - Martin Kutrib; Andreas Malcher (Discret. Appl. Math., 2007)

When Church-Rosser Becomes Context Free. - Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2007)

On Metalinear Parallel Communicating Grammar Systems. - Andreas Malcher; Bettina Sunckel (Int. J. Found. Comput. Sci., 2007)

On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. - Andreas Malcher (J. Autom. Lang. Comb., 2007)

Context-dependent nondeterminism for pushdown automata. - Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2007)

Real-time reversible language recognition by cellular automata. - Martin Kutrib; Andreas Malcher (Automata, 2008)

Recent results on iterative arrays with small space bounds. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Automata, 2008)

The Boolean closure of linear context-free languages. - Martin Kutrib; Andreas Malcher; Detlef Wotschke (Acta Informatica, 2008)

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems - Markus Holzer 001; Martin Kutrib; Andreas Malcher (CSP, 2008)

Fast reversible language recognition using cellular automata. - Martin Kutrib; Andreas Malcher (Inf. Comput., 2008)

Descriptional Complexity of Splicing Systems. - Remco Loos; Andreas Malcher; Detlef Wotschke (Int. J. Found. Comput. Sci., 2008)

Logical Description of Structured and XML Languages. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2009)

Bounded Languages Meet Cellular Automata with Sparse Communication - Martin Kutrib; Andreas Malcher (DCFS, 2009)

On One-way One-bit O (One)-message Cellular Automata. - Martin Kutrib; Andreas Malcher (AUTOMATA, 2009)

Editorial. - Jürgen Dassow; Andreas Malcher (J. Autom. Lang. Comb., 2009)

Computations and Decidability of Iterative Arrays with Restricted Communication. - Martin Kutrib; Andreas Malcher (Parallel Process. Lett., 2009)

Regulated nondeterminism in pushdown automata. - Martin Kutrib; Andreas Malcher; Larissa Werlein (Theor. Comput. Sci., 2009)

The Size of One-Way Cellular Automata. - Martin Kutrib; Jonas Lefèvre; Andreas Malcher (Automata, 2010)

Measuring Communication in Cellular Automata. - Martin Kutrib; Andreas Malcher (JAC, 2010)

Transductions Computed by Iterative Arrays. - Martin Kutrib; Andreas Malcher (JAC, 2010)

On the Expressive Power of FO[ + ]. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (LATA, 2010)

Two-Party Watson-Crick Computations. - Martin Kutrib; Andreas Malcher (CIAA, 2010)

Remembering Chandra Kintala - Martin Kappes; Andreas Malcher; Detlef Wotschke (DCFS, 2010)

Sublinearly Space Bounded Iterative Arrays. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2010)

One-Way Cellular Automata, Bounded Languages, and Minimal Communication. - Martin Kutrib; Andreas Malcher (J. Autom. Lang. Comb., 2010)

Real-time reversible iterative arrays. - Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2010)

Cellular automata with sparse communication. - Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2010)

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2011)

Complexity of multi-head finite automata: Origins and directions. - Markus Holzer 001; Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2011)

Cellular automata with limited inter-cell bandwidth. - Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2011)

Iterative Arrays: Little Resources Big Size Impact. - Martin Kutrib; Andreas Malcher (ACRI, 2012)

States and Heads Do Count for Unary Multi-head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2012)

Input-Driven Stack Automata. - Suna Bensch; Markus Holzer 001; Martin Kutrib; Andreas Malcher (IFIP TCS, 2012)

First-order logics: some characterizations and closure properties. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Acta Informatica, 2012)

Transductions Computed by One-Dimensional Cellular Automata - Martin Kutrib; Andreas Malcher (AUTOMATA & JAC, 2012)

Report from DCFS 2012. - Andreas Malcher (Bull. EATCS, 2012)

On the Computational Capacity of Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2012)

In Memoriam Chandra Kintala. - Martin Kappes; Andreas Malcher; Detlef Wotschke (Int. J. Found. Comput. Sci., 2012)

Descriptional Complexity of Pushdown Store Languages. - Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2012)

The Size Impact of Little Iterative Array Resources. - Martin Kutrib; Andreas Malcher (J. Cell. Autom., 2012)

Reversible pushdown automata. - Martin Kutrib; Andreas Malcher (J. Comput. Syst. Sci., 2012)

Descriptional complexity of two-way pushdown automata with restricted head reversals. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2012)

A Direct Construction of Finite State Automata for Pushdown Store Languages. - Viliam Geffert; Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (DCFS, 2013)

Size of Unary One-Way Multi-head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (DCFS, 2013)

One-Way Multi-Head Finite Automata with Pebbles But No States. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2013)

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (CIAA, 2013)

One-Dimensional Cellular Automaton Transducers. - Martin Kutrib; Andreas Malcher (Fundam. Informaticae, 2013)

Descriptional complexity of bounded context-free languages. - Andreas Malcher; Giovanni Pighizzini (Inf. Comput., 2013)

Real-Time Reversible One-Way Cellular Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Automata, 2014)

Regularity and Size of Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (DCFS, 2014)

Measuring Communication in Automata Systems - (Invited Paper). - Martin Kutrib; Andreas Malcher (Developments in Language Theory, 2014)

Deterministic Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2014)

Head and state hierarchies for unary multi-head finite automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Acta Informatica, 2014)

Measuring Communication in Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (AFL, 2014)

Oblivious two-way finite automata: Decidability and complexity. - Martin Kutrib; Andreas Malcher; Giovanni Pighizzini (Inf. Comput., 2014)

Simulations of Unary One-Way Multi-Head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2014)

Stateless One-Way Multi-Head Finite Automata with Pebbles. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2014)

Preface. - Jarkko Kari; Martin Kutrib; Andreas Malcher (J. Cell. Autom., 2014)

Tinput-Driven Pushdown Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (MCU, 2015)

When input-driven pushdown automata meet reversibility. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (NCMA, 2015)

A Hierarchy of Fast Reversible Turing Machines. - Holger Bock Axelsen; Sebastian Jakobi; Martin Kutrib; Andreas Malcher (RC, 2015)

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2015)

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (Theor. Comput. Sci., 2015)

Reversible Shrinking Two-Pushdown Automata. - Holger Bock Axelsen; Markus Holzer 001; Martin Kutrib; Andreas Malcher (LATA, 2016)

Input-Driven Queue Automata with Internal Transductions. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (LATA, 2016)

Boosting Reversible Pushdown Machines by Preprocessing. - Holger Bock Axelsen; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RC, 2016)

Reversible Queue Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Fundam. Informaticae, 2016)

Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2016)

When input-driven pushdown automata meet reversiblity. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2016)

Iterative Arrays with Set Storage. - Martin Kutrib; Andreas Malcher (J. Cell. Autom., 2016)

Fast One-Way Cellular Automata with Reversible Mealy Cells. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (AUTOMATA, 2017)

Decidability questions for insertion systems. - Andreas Malcher (NCMA, 2017)

Tinput-Driven Pushdown, Counter, and Stack Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Fundam. Informaticae, 2017)

Descriptional Complexity of Bounded Regular Languages. - Andrea Herrmann 002; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (J. Autom. Lang. Comb., 2017)

Shrinking one-way cellular automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Nat. Comput., 2017)

One-way reversible multi-head finite automata. - Martin Kutrib; Andreas Malcher (Theor. Comput. Sci., 2017)

Cellular Automata: Descriptional Complexity and Decidability. - Martin Kutrib; Andreas Malcher (Reversibility and Universality, 2018)

Queue Automata: Foundations and Developments. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Reversibility and Universality, 2018)

Boosting Pushdown and Queue Machines by Preprocessing. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (CIAA, 2018)

Report on DCFS 2018. - Andreas Malcher (Bull. EATCS, 2018)

Diving into the queue. - Simon Beier; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2018)

Iterated Uniform Finite-State Transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2019)

Report on DCFS 2019. - Andreas Malcher (Bull. EATCS, 2019)

Transducing reversibly with finite state machines. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2019)

Cellular String Generators. - Martin Kutrib; Andreas Malcher (Automata, 2020)

Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (CiE, 2020)

Boosting Reversible Pushdown and Queue Machines by Preprocessing. - Holger Bock Axelsen; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2020)

Hierarchies and undecidability results for iterative arrays with sparse communication. - Andreas Malcher (Nat. Comput., 2020)

Iterated Transduction on Unary Languages. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2021)

Preface to Martin Kutrib Festschrift. - Henning Fernau; Andreas Malcher; Giovanni Pighizzini (Acta Informatica, 2021)

String Generation by Cellular Automata. - Martin Kutrib; Andreas Malcher (Complex Syst., 2021)

Decidability Questions for Insertion Systems and Related Models. - Andreas Malcher (Fundam. Informaticae, 2021)

Reversible pushdown transducers. - Bruno Guillon; Martin Kutrib; Andreas Malcher; Luca Prigioniero (Inf. Comput., 2021)

Digging input-driven pushdown automata. - Martin Kutrib; Andreas Malcher (RAIRO Theor. Informatics Appl., 2021)

Input-driven multi-counter automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2021)

Finite automata with undirected state graphs. - Martin Kutrib; Andreas Malcher; Christian Schneider (Acta Informatica, 2022)

Reversible Computations of One-Way Counter Automata. - Martin Kutrib; Andreas Malcher (NCMA, 2022)

Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Fundam. Informaticae, 2022)

Descriptional complexity of iterated uniform finite-state transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Inf. Comput., 2022)

Input-Driven Double-Head Pushdown Automata. - Markus Holzer 001; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2022)

Reversible Shrinking Two-Pushdown Automata. - Holger Bock Axelsen; Martin Kutrib; Andreas Malcher (J. Autom. Lang. Comb., 2022)

Iterative arrays with finite inter-cell communication. - Martin Kutrib; Andreas Malcher (Nat. Comput., 2022)

One-dimensional pattern generation by cellular automata. - Martin Kutrib; Andreas Malcher (Nat. Comput., 2022)

Reversible Two-Party Computations. - Martin Kutrib; Andreas Malcher (AFL, 2023)

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2023)

Iterated uniform finite-state transducers on unary languages. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2023)

Cellular Automata: Communication Matters. - Martin Kutrib; Andreas Malcher (CiE, 2024)

Cellular Automata: From Black-and-White to High Gloss Color. - Martin Kutrib; Andreas Malcher (DLT, 2024)

Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (DLT, 2024)

On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (CIAA, 2024)

Complexity of Unary Exclusive Nondeterministic Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (NCMA, 2024)

On the power of pushing or stationary moves for input-driven pushdown automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2024)

Real-Time Pattern Generation by One-Dimensional Cellular Automata. - Martin Kutrib; Andreas Malcher (Advances in Cellular Automata - Volume 1: Theory (1), 2025)

Two-Way Finite Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (DCFS, 2025)

Complexity of exclusive nondeterministic finite automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Inf. Comput., 2025)

Preface. - Martin Kutrib; Andreas Malcher; Branislav Rovan (Int. J. Found. Comput. Sci., 2025)

Input-Driven Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (CoRR, 2025)