Andreas Malcher

176 papers B 4C 34Journal 79Unranked 53

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Deterministic pushdown automata with translucent input letters. Inf. Comput. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2026	J	`jnl`	On properties of languages accepted by deterministic pushdown automata with translucent input letters. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2025	J	`jnl`	Complexity of exclusive nondeterministic finite automata. Inf. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	—	`ed.`	Descriptional Complexity of Formal Systems - 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025, Proceedings DCFS Andreas Malcher, Luca Prigioniero
2025	—	`conf`	Input-Driven Pushdown Automata with Translucent Input Letters. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Branislav Rovan
2025	J	`jnl`	Preface: Celebrating Carlo's 60th Birthday. J. Autom. Lang. Comb. Martin Kutrib, Andreas Malcher, Nelma Moreira, Rogério Reis
2025	—	`ch.`	Real-Time Pattern Generation by One-Dimensional Cellular Automata. Advances in Cellular Automata - Volume 1: Theory (1) Martin Kutrib, Andreas Malcher
2025	C	`conf`	State-Freezing Pushdown Automata. CIAA Martin Kutrib, Andreas Malcher, Priscilla Raucci
2025	—	`conf`	Two-Way Finite Automata with Translucent Input Letters. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2024	C	`conf`	Cellular Automata: Communication Matters. CiE Martin Kutrib, Andreas Malcher
2024	C	`conf`	Cellular Automata: From Black-and-White to High Gloss Color. DLT Martin Kutrib, Andreas Malcher
2024	—	`conf`	Complexity of Unary Exclusive Nondeterministic Finite Automata. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2024	C	`conf`	Deterministic Pushdown Automata with Translucent Input Letters. DLT Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2024	C	`conf`	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2024	J	`jnl`	On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2024	J	`jnl`	Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher
2023	—	`conf`	Complexity of Exclusive Nondeterministic Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2023	J	`jnl`	Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2023	J	`jnl`	Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2023	—	`conf`	Reversible Two-Party Computations. AFL Martin Kutrib, Andreas Malcher
2022	J	`jnl`	Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Finite automata with undirected state graphs. Acta Informatica Martin Kutrib, Andreas Malcher, Christian Schneider
2022	J	`jnl`	Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2022	J	`jnl`	Iterative arrays with finite inter-cell communication. Nat. Comput. Martin Kutrib, Andreas Malcher
2022	C	`conf`	On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2022	J	`jnl`	One-dimensional pattern generation by cellular automata. Nat. Comput. Martin Kutrib, Andreas Malcher
2022	—	`conf`	Reversible Computations of One-Way Counter Automata. NCMA Martin Kutrib, Andreas Malcher
2022	J	`jnl`	Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. Holger Bock Axelsen, Martin Kutrib, Andreas Malcher
2021	J	`jnl`	Decidability Questions for Insertion Systems and Related Models. Fundam. Informaticae Andreas Malcher
2021	J	`jnl`	Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher
2021	J	`jnl`	Input-driven multi-counter automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2021	—	`conf`	Iterated Transduction on Unary Languages. ICTCS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2021	B	`conf`	Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2021	J	`jnl`	Preface to Martin Kutrib Festschrift. Acta Informatica Henning Fernau, Andreas Malcher, Giovanni Pighizzini
2021	J	`jnl`	Reversible pushdown transducers. Inf. Comput. Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
2021	J	`jnl`	String Generation by Cellular Automata. Complex Syst. Martin Kutrib, Andreas Malcher
2020	J	`jnl`	Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2020	—	`conf`	Cellular String Generators. Automata Martin Kutrib, Andreas Malcher
2020	C	`conf`	Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2020	J	`jnl`	Hierarchies and undecidability results for iterative arrays with sparse communication. Nat. Comput. Andreas Malcher
2020	—	`conf`	Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2020	—	`conf`	One-Dimensional Pattern Generation by Cellular Automata. ACRI Martin Kutrib, Andreas Malcher
2019	—	`conf`	Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2019	—	`conf`	Digging input-driven pushdown automata. NCMA Martin Kutrib, Andreas Malcher
2019	C	`conf`	Input-Driven Multi-counter Automata. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2019	—	`conf`	Iterated Uniform Finite-State Transducers. ICTCS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2019	—	`conf`	Iterative Arrays with Finite Inter-cell Communication. Automata Martin Kutrib, Andreas Malcher
2019	J	`jnl`	Report on DCFS 2019. Bull. EATCS Andreas Malcher
2019	J	`jnl`	Transducing reversibly with finite state machines. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	C	`conf`	Boosting Pushdown and Queue Machines by Preprocessing. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	—	`ch.`	Cellular Automata: Descriptional Complexity and Decidability. Reversibility and Universality Martin Kutrib, Andreas Malcher
2018	J	`jnl`	Diving into the queue. RAIRO Theor. Informatics Appl. Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	—	`conf`	Finite Automata with Undirected State Graphs. DCFS Martin Kutrib, Andreas Malcher, Christian Schneider
2018	—	`conf`	Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication. Automata Andreas Malcher
2018	—	`ch.`	Queue Automata: Foundations and Developments. Reversibility and Universality Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	J	`jnl`	Report on DCFS 2018. Bull. EATCS Andreas Malcher
2018	C	`conf`	Reversible Pushdown Transducers. DLT Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
2017	—	`conf`	Decidability questions for insertion systems. NCMA Andreas Malcher
2017	J	`jnl`	Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Input-Driven Double-Head Pushdown Automata. AFL Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	J	`jnl`	One-way reversible multi-head finite automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2017	J	`jnl`	Shrinking one-way cellular automata. Nat. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	J	`jnl`	Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	C	`conf`	Transducing Reversibly with Finite State Machines. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	C	`conf`	Boosting Reversible Pushdown Machines by Preprocessing. RC Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Descriptional Complexity of Bounded Regular Languages. DCFS Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Diving into the queue. NCMA Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	C	`conf`	Input-Driven Queue Automata with Internal Transductions. LATA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	Iterative Arrays with Set Storage. J. Cell. Autom. Martin Kutrib, Andreas Malcher
2016	J	`jnl`	Reversible Queue Automata. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	C	`conf`	Reversible Shrinking Two-Pushdown Automata. LATA Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher
2016	J	`jnl`	Set Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	C	`conf`	A Hierarchy of Fast Reversible Turing Machines. RC Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher
2015	J	`jnl`	Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2015	J	`jnl`	Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. Henning Bordihn, Martin Kutrib, Andreas Malcher
2015	—	`conf`	Shrinking One-Way Cellular Automata. Automata Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	C	`conf`	Tinput-Driven Pushdown Automata. MCU Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	—	`conf`	When input-driven pushdown automata meet reversibility. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	C	`conf`	Deterministic Set Automata. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Head and state hierarchies for unary multi-head finite automata. Acta Informatica Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	—	`conf`	Iterative Arrays with Set Storage. ACRI Martin Kutrib, Andreas Malcher
2014	C	`conf`	Measuring Communication in Automata Systems - (Invited Paper). Developments in Language Theory Martin Kutrib, Andreas Malcher
2014	—	`conf`	Measuring Communication in Parallel Communicating Finite Automata. AFL Henning Bordihn, Martin Kutrib, Andreas Malcher
2014	J	`jnl`	Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2014	J	`jnl`	Preface. J. Cell. Autom. Jarkko Kari, Martin Kutrib, Andreas Malcher
2014	—	`conf`	Real-Time Reversible One-Way Cellular Automata. Automata Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	—	`conf`	Regularity and Size of Set Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	—	`conf`	Reversible queue automata. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013	—	`conf`	A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2013	—	`ed.`	Cellular Automata and Discrete Complex Systems - 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013. Proceedings Automata Jarkko Kari, Martin Kutrib, Andreas Malcher
2013	J	`jnl`	Descriptional complexity of bounded context-free languages. Inf. Comput. Andreas Malcher, Giovanni Pighizzini
2013	C	`conf`	Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2013	J	`jnl`	One-Dimensional Cellular Automaton Transducers. Fundam. Informaticae Martin Kutrib, Andreas Malcher
2013	C	`conf`	One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013	—	`conf`	Size of Unary One-Way Multi-head Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2012	—	`conf`	Descriptional Complexity of Pushdown Store Languages. DCFS Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	First-order logics: some characterizations and closure properties. Acta Informatica Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. Martin Kappes, Andreas Malcher, Detlef Wotschke
2012	—	`conf`	Input-Driven Stack Automata. IFIP TCS Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher
2012	—	`conf`	Iterative Arrays: Little Resources Big Size Impact. ACRI Martin Kutrib, Andreas Malcher
2012	B	`conf`	Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2012	J	`jnl`	On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. Henning Bordihn, Martin Kutrib, Andreas Malcher
2012	C	`conf`	One-Way Reversible Multi-head Finite Automata. RC Martin Kutrib, Andreas Malcher
2012	J	`jnl`	Report from DCFS 2012. Bull. EATCS Andreas Malcher
2012	J	`jnl`	Reversible pushdown automata. J. Comput. Syst. Sci. Martin Kutrib, Andreas Malcher
2012	C	`conf`	States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2012	J	`jnl`	The Size Impact of Little Iterative Array Resources. J. Cell. Autom. Martin Kutrib, Andreas Malcher
2012	—	`conf`	Transductions Computed by One-Dimensional Cellular Automata AUTOMATA & JAC Martin Kutrib, Andreas Malcher
2011	J	`jnl`	Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2011	J	`jnl`	Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. Markus Holzer, Martin Kutrib, Andreas Malcher
2011	—	`conf`	Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2011	J	`jnl`	Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. Henning Bordihn, Martin Kutrib, Andreas Malcher
2010	J	`jnl`	Cellular automata with sparse communication. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2010	—	`conf`	Measuring Communication in Cellular Automata. JAC Martin Kutrib, Andreas Malcher
2010	C	`conf`	On the Expressive Power of FO[ + ]. LATA Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2010	J	`jnl`	One-Way Cellular Automata, Bounded Languages, and Minimal Communication. J. Autom. Lang. Comb. Martin Kutrib, Andreas Malcher
2010	J	`jnl`	Real-time reversible iterative arrays. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2010	—	`conf`	Remembering Chandra Kintala DCFS Martin Kappes, Andreas Malcher, Detlef Wotschke
2010	C	`conf`	Reversible Pushdown Automata. LATA Martin Kutrib, Andreas Malcher
2010	J	`jnl`	Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2010	—	`conf`	The Size of One-Way Cellular Automata. Automata Martin Kutrib, Jonas Lefèvre, Andreas Malcher
2010	—	`conf`	Transductions Computed by Iterative Arrays. JAC Martin Kutrib, Andreas Malcher
2010	C	`conf`	Two-Party Watson-Crick Computations. CIAA Martin Kutrib, Andreas Malcher
2010	C	`conf`	Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory Henning Bordihn, Martin Kutrib, Andreas Malcher
2009	—	`conf`	Bounded Languages Meet Cellular Automata with Sparse Communication DCFS Martin Kutrib, Andreas Malcher
2009	C	`conf`	Cellular Automata with Sparse Communication. CIAA Martin Kutrib, Andreas Malcher
2009	J	`jnl`	Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Process. Lett. Martin Kutrib, Andreas Malcher
2009	J	`jnl`	Descriptional complexity of bounded context-free languages CoRR Andreas Malcher, Giovanni Pighizzini
2009	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Andreas Malcher
2009	—	`conf`	Logical Description of Structured and XML Languages. ICTCS Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2009	—	`conf`	On One-way One-bit O (One)-message Cellular Automata. AUTOMATA Martin Kutrib, Andreas Malcher
2009	J	`jnl`	Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Larissa Werlein
2008	J	`jnl`	Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. Remco Loos, Andreas Malcher, Detlef Wotschke
2008	J	`jnl`	Fast reversible language recognition using cellular automata. Inf. Comput. Martin Kutrib, Andreas Malcher
2008	—	`conf`	Multi-Head Finite Automata: Characterizations, Concepts and Open Problems CSP Markus Holzer, Martin Kutrib, Andreas Malcher
2008	C	`conf`	On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory Henning Bordihn, Martin Kutrib, Andreas Malcher
2008	—	`conf`	Real-time reversible language recognition by cellular automata. Automata Martin Kutrib, Andreas Malcher
2008	—	`conf`	Recent results on iterative arrays with small space bounds. Automata Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2008	—	`conf`	Sublinearly Space Bounded Iterative Arrays. AFL Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2008	J	`jnl`	The Boolean closure of linear context-free languages. Acta Informatica Martin Kutrib, Andreas Malcher, Detlef Wotschke
2007	J	`jnl`	Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2007	C	`conf`	Descriptional Complexity of Bounded Context-Free Languages. Developments in Language Theory Andreas Malcher, Giovanni Pighizzini
2007	—	`conf`	Descriptional Complexity of Splicing Systems. DCFS Remco Loos, Andreas Malcher, Detlef Wotschke
2007	C	`conf`	Fast Reversible Language Recognition Using Cellular Automata. LATA Martin Kutrib, Andreas Malcher
2007	J	`jnl`	Finite turns and the regular closure of linear context-free languages. Discret. Appl. Math. Martin Kutrib, Andreas Malcher
2007	J	`jnl`	On Metalinear Parallel Communicating Grammar Systems. Int. J. Found. Comput. Sci. Andreas Malcher, Bettina Sunckel
2007	J	`jnl`	On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. J. Autom. Lang. Comb. Andreas Malcher
2007	B	`conf`	Real-Time Reversible Iterative Arrays. FCT Martin Kutrib, Andreas Malcher
2007	C	`conf`	Regulated Nondeterminism in Pushdown Automata. CIAA Martin Kutrib, Andreas Malcher, Larissa Werlein
2007	J	`jnl`	When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher
2006	—	`conf`	Cellular Automata and Descriptional Complexity. DCFS Andreas Malcher
2006	C	`conf`	Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory Martin Kutrib, Andreas Malcher
2006	—	`conf`	Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS Martin Kutrib, Andreas Malcher
2006	B	`conf`	Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS Martin Kutrib, Andreas Malcher
2005	—	`conf`	On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. DCFS Andreas Malcher
2005	J	`jnl`	On two-way communication in cellular automata with a fixed number of cells. Theor. Comput. Sci. Andreas Malcher
2004	—	`—`	Beschreibungskomplexität von Zellularautomaten. Andreas Malcher
2004	J	`jnl`	Minimizing finite automata is computationally hard. Theor. Comput. Sci. Andreas Malcher
2004	J	`jnl`	On the Descriptional Complexity of Iterative Arrays. IEICE Trans. Inf. Syst. Andreas Malcher
2004	C	`conf`	The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory Martin Kutrib, Andreas Malcher, Detlef Wotschke
2003	C	`conf`	Minimizing Finite Automata Is Computationally Hard. Developments in Language Theory Andreas Malcher
2003	J	`jnl`	On One-Way Cellular Automata with a Fixed Number of Cells. Fundam. Informaticae Andreas Malcher
2003	—	`conf`	On Two-Way Communication in Cellular Automata With a Fixed Number of Cells. DCFS Andreas Malcher
2002	J	`jnl`	Descriptional Complexity of Cellular Automata and Decidability Questions. J. Autom. Lang. Comb. Andreas Malcher
2002	J	`jnl`	Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
2002	—	`conf`	On One-Way Cellular Automata with a Fixed Number of Cells. DCFS Andreas Malcher
2001	—	`conf`	Descriptional Complexity of Cellular Automata and Decidability Questions. DCFS Andreas Malcher