Martin Kutrib - RankMe

346 papers A* 1B 15C 80Misc 1Journal 147Unranked 83

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`	Deterministic tree-walking-storage automata. Acta Informatica Martin Kutrib, Uwe Meyer
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
2026	J	`jnl`	Sweeping Input-Driven Pushdown Automata. Int. J. Found. Comput. Sci. Martin Kutrib
2025	J	`jnl`	Complexity of exclusive nondeterministic finite automata. Inf. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	J	`jnl`	Deterministic real-time tree-walking-storage automata. Acta Informatica Martin Kutrib, Uwe Meyer
2025	—	`conf`	Input-Driven Pushdown Automata with Translucent Input Letters. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	J	`jnl`	Kernels of Context-Free Languages. Int. J. Found. Comput. Sci. Martin Kutrib, Luca Prigioniero
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`	String Assembling Systems: Origins and Directions. Languages of Cooperation and Communication Martin Kutrib, Matthias Wendlandt
2025	C	`conf`	Subregular Expressions with Two Operations. DLT Martin Kutrib, Priscilla Raucci, Matthias Wendlandt
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`	Preface: Henning has Turned 60. J. Autom. Lang. Comb. Martin Kutrib, Bianca Truthe
2024	J	`jnl`	Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher
2024	J	`jnl`	Variants of string assembling systems. Nat. Comput. Martin Kutrib, Matthias Wendlandt
2023	J	`jnl`	25 Editions of DCFS: Origins and Directions. Bull. EATCS Jürgen Dassow, Martin Kutrib, Giovanni Pighizzini
2023	—	`conf`	Complexity of Exclusive Nondeterministic Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2023	—	`conf`	Deterministic Real-Time Tree-Walking-Storage Automata. NCMA Martin Kutrib, Uwe Meyer
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	C	`ed.`	Reversible Computation - 15th International Conference, RC 2023, Giessen, Germany, July 18-19, 2023, Proceedings RC Martin Kutrib, Uwe Meyer
2023	J	`jnl`	Reversible Top-Down Syntax Analysis. Int. J. Found. Comput. Sci. Martin Kutrib, Uwe Meyer
2023	—	`conf`	Reversible Two-Party Computations. AFL Martin Kutrib, Andreas Malcher
2023	J	`jnl`	State complexity of finite partial languages. Theor. Comput. Sci. Martin Kutrib, Matthias Wendlandt
2023	C	`conf`	Sweeping Input-Driven Pushdown Automata. CIAA Martin Kutrib
2023	J	`jnl`	Syntax checking either way. Theor. Comput. Sci. Martin Kutrib, Uwe Meyer
2023	C	`conf`	Tree-Walking-Storage Automata. DLT Martin Kutrib, Uwe Meyer
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	J	`jnl`	Iterative arrays with self-verifying communication cell. Nat. Comput. Martin Kutrib
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	C	`conf`	Optimizing Reversible Programs. RC Niklas Deworetzki, Martin Kutrib, Uwe Meyer, Pia-Doreen Ritzke
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
2022	—	`conf`	State Complexity of Finite Partial Languages. DCFS Martin Kutrib, Matthias Wendlandt
2022	C	`conf`	Syntax Checking Either Way. CIAA Martin Kutrib, Uwe Meyer
2021	C	`conf`	Boolean Kernels of Context-Free Languages. CIAA Martin Kutrib, Luca Prigioniero
2021	C	`conf`	Compiling Janus to RSSA. RC Martin Kutrib, Uwe Meyer, Niklas Deworetzki, Marc Schuster
2021	—	`ch.`	Descriptional complexity of regular languages. Handbook of Automata Theory (I.) Hermann Gruber, Markus Holzer, Martin Kutrib
2021	J	`jnl`	Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher
2021	—	`ch.`	Hot Current Topics of Descriptional Complexity. IFIP's Exciting First 60+ Years Martin Kutrib, Nelma Moreira, Giovanni Pighizzini, Rogério Reis
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. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
2021	C	`conf`	Reversible Top-Down Syntax Analysis. DLT Martin Kutrib, Uwe Meyer
2021	J	`jnl`	Reversible pushdown transducers. Inf. Comput. Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
2021	J	`jnl`	Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae Henning Fernau, Martin Kutrib, Matthias Wendlandt
2021	—	`conf`	State Complexity of Partial Word Finite Automata. DCFS Martin Kutrib, Matthias Wendlandt
2021	—	`conf`	String Assembling Systems: Comparison to Sticker Systems and Decidability. UCNC Martin Kutrib, Matthias Wendlandt
2021	J	`jnl`	String Generation by Cellular Automata. Complex Syst. Martin Kutrib, Andreas Malcher
2021	J	`jnl`	Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae Markus Holzer, Martin Kutrib, Friedrich Otto
2020	J	`jnl`	Automata That May Change Their Mind. J. Autom. Lang. Comb. Markus Holzer, Martin Kutrib
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	—	`ed.`	Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part I FM Workshops (1) Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas
2020	—	`ed.`	Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part II FM Workshops (2) Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas
2020	—	`ch.`	Foundations of Reversible Computation. Selected Results of the COST Action IC1405 Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Lukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna, Luca Prigioniero, Irek Ulidowski, Germán Vidal
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	B	`conf`	Kernels of Sub-classes of Context-Free Languages. SOFSEM Martin Kutrib
2020	J	`jnl`	On Two-Sided Locally Testable Languages. J. Autom. Lang. Comb. Martin Kutrib, Friedrich Otto
2020	—	`conf`	One-Dimensional Pattern Generation by Cellular Automata. ACRI Martin Kutrib, Andreas Malcher
2020	J	`jnl`	Preface. Nat. Comput. Jan M. Baetens, Martin Kutrib
2020	J	`jnl`	Self-Verifying Cellular Automata. J. Cell. Autom. Martin Kutrib, Thomas Worsch
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	—	`conf`	Iterative Arrays with Self-verifying Communication Cell. Automata Martin Kutrib, Thomas Worsch
2019	B	`conf`	Multi-stranded String Assembling Systems. SOFSEM Martin Kutrib, Matthias Wendlandt
2019	C	`conf`	Non-Recursive Trade-Offs Are "Almost Everywhere". CiE Markus Holzer, Martin Kutrib
2019	J	`jnl`	One-Time Nondeterministic Computations. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
2019	J	`jnl`	Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. Simon Beier, Markus Holzer, Martin Kutrib
2019	J	`jnl`	Transducing reversibly with finite state machines. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	—	`conf`	Automata that may change their mind. NCMA Markus Holzer, Martin Kutrib
2018	C	`conf`	Boosting Pushdown and Queue Machines by Preprocessing. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	—	`ed.`	Cellular Automata and Discrete Complex Systems - 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20-22, 2018, Proceedings Automata Jan M. Baetens, Martin Kutrib
2018	—	`ch.`	Cellular Automata: Descriptional Complexity and Decidability. Reversibility and Universality Martin Kutrib, Andreas Malcher
2018	J	`jnl`	Descriptional complexity of limited automata. Inf. Comput. Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt
2018	J	`jnl`	Diving into the queue. RAIRO Theor. Informatics Appl. Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	J	`jnl`	Expressive capacity of subregular expressions. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2018	—	`conf`	Finite Automata with Undirected State Graphs. DCFS Martin Kutrib, Andreas Malcher, Christian Schneider
2018	J	`jnl`	Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. Markus Holzer, Sebastian Jakobi, Martin Kutrib
2018	C	`conf`	Parametrizing String Assembling Systems. CIAA Martin Kutrib, Matthias Wendlandt
2018	—	`ch.`	Queue Automata: Foundations and Developments. Reversibility and Universality Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	C	`conf`	Reversible Pushdown Transducers. DLT Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
2018	J	`jnl`	Revisiting the cutting of the firing squad synchronization. Nat. Comput. Antonios Dimitriadis, Martin Kutrib, Georgios Ch. Sirakoulis
2018	—	`conf`	Self-verifying Cellular Automata. ACRI Martin Kutrib, Thomas Worsch
2018	—	`conf`	Two-sided locally testable languages. NCMA Martin Kutrib, Friedrich Otto
2017	J	`jnl`	Concatenation-free languages. Theor. Comput. Sci. Martin Kutrib, Matthias Wendlandt
2017	J	`jnl`	Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	J	`jnl`	Deterministic Stack Transducers. Int. J. Found. Comput. Sci. Suna Bensch, Johanna Björklund, Martin Kutrib
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	—	`conf`	On the Descriptional Complexity of Operations on Semilinear Sets. AFL Simon Beier, Markus Holzer, Martin Kutrib
2017	—	`conf`	One-Time Nondeterministic Computations. DCFS Markus Holzer, Martin Kutrib
2017	J	`jnl`	One-way reversible multi-head finite automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2017	C	`conf`	Operational State Complexity and Decidability of Jumping Finite Automata. DLT Simon Beier, Markus Holzer, Martin Kutrib
2017	J	`jnl`	Reversible Limited Automata. Fundam. Informaticae Martin Kutrib, Matthias Wendlandt
2017	C	`conf`	Reversible Nondeterministic Finite Automata. RC Markus Holzer, Martin Kutrib
2017	—	`conf`	Self-verifying pushdown automata. NCMA Henning Fernau, Martin Kutrib, Matthias Wendlandt
2017	J	`jnl`	Shrinking one-way cellular automata. Nat. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Structure and Complexity of Some Subregular Language Families. The Role of Theory in Computer Science Markus Holzer, Martin Kutrib
2017	J	`jnl`	The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. Holger Bock Axelsen, Markus Holzer, Martin Kutrib
2017	J	`jnl`	The chop of languages. Theor. Comput. Sci. Markus Holzer, Sebastian Jakobi, Martin Kutrib
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
2017	—	`conf`	Two-sided strictly locally testable languages. NCMA Markus Holzer, Martin Kutrib, Friedrich Otto
2016	C	`conf`	Boosting Reversible Pushdown Machines by Preprocessing. RC Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Cutting the Firing Squad Synchronization. ACRI Antonios Dimitriadis, Martin Kutrib, Georgios Ch. Sirakoulis
2016	—	`conf`	Descriptional Complexity of Bounded Regular Languages. DCFS Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	C	`conf`	Deterministic Stack Transducers. CIAA Suna Bensch, Johanna Björklund, Martin Kutrib
2016	—	`conf`	Diving into the queue. NCMA Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	Editorial. J. Autom. Lang. Comb. Markus Holzer, Martin Kutrib, Bianca Truthe
2016	—	`conf`	Expressive capacity of subregular expressions. NCMA Martin Kutrib, 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`	Preface. J. Autom. Lang. Comb. Markus Holzer, Martin Kutrib, Bianca Truthe
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	C	`conf`	The Degree of Irreversibility in Deterministic Finite Automata. CIAA Holger Bock Axelsen, Markus Holzer, Martin Kutrib
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 One-Way Turing Machines with Sublinear Space. Fundam. Informaticae Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
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	C	`conf`	Expressive Capacity of Concatenation Freeness. CIAA Martin Kutrib, Matthias Wendlandt
2015	C	`conf`	Minimal Reversible Deterministic Finite Automata. DLT Markus Holzer, Sebastian Jakobi, Martin Kutrib
2015	—	`conf`	On Simulation Cost of Unary Limited Automata. DCFS Martin Kutrib, Matthias Wendlandt
2015	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
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	C	`conf`	Reversible Limited Automata. MCU Martin Kutrib, Matthias Wendlandt
2015	—	`conf`	Reversible and Irreversible Computations of Deterministic Finite-State Devices. MFCS (1) Martin Kutrib
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	—	`conf`	Aspects of Reversibility for Classical Automata. Computing with New Resources Martin Kutrib
2014	J	`jnl`	Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2014	—	`conf`	Complexity of One-Way Cellular Automata. Automata Martin Kutrib
2014	C	`conf`	Complexity of Operation Problems. CiE Martin Kutrib
2014	C	`conf`	Degrees of Reversibility for DFA and DPDA. RC Martin Kutrib, Thomas Worsch
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	C	`ed.`	Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings CIAA Markus Holzer, Martin Kutrib
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`	Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. Henning Bordihn, Martin Kutrib, Matthias Wendlandt
2014	J	`jnl`	Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2014	B	`conf`	Parameterized Prefix Distance between Regular Languages. SOFSEM Martin Kutrib, Katja Meckel, Matthias Wendlandt
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`	Self-Assembling Pushdown Automata. J. Autom. Lang. Comb. Markus Holzer, Martin Kutrib
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
2014	C	`conf`	ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. LATA Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard
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	—	`conf`	Deterministic one-way Turing machines with sublinear space bounds. NCMA Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
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`	On the Descriptional Complexity of the Window Size for Deleting Restarting Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Friedrich Otto
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	J	`jnl`	Recent Trends in Descriptional Complexity of Formal Languages. Bull. EATCS Martin Kutrib, Giovanni Pighizzini
2013	—	`conf`	Size of Unary One-Way Multi-head Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013	C	`conf`	Time-Symmetric Machines. RC Martin Kutrib, Thomas Worsch
2012	—	`conf`	Bidirectional String Assembling Systems. NCMA Martin Kutrib, Matthias Wendlandt
2012	—	`ed.`	Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings DCFS Martin Kutrib, Nelma Moreira, Rogério Reis
2012	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis
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	—	`ed.`	Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday Languages Alive Henning Bordihn, Martin Kutrib, Bianca Truthe
2012	J	`jnl`	Non-deterministic cellular automata and languages. Int. J. Gen. Syst. Martin Kutrib
2012	J	`jnl`	Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. Markus Holzer, Martin Kutrib, Katja Meckel
2012	B	`conf`	Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2012	—	`conf`	On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. Languages Alive Martin Kutrib, Friedrich Otto
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`	On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. CIAA Martin Kutrib, Friedrich Otto
2012	C	`conf`	One-Way Reversible Multi-head Finite Automata. RC Martin Kutrib, Andreas Malcher
2012	J	`jnl`	Preface. Theor. Comput. Sci. Markus Holzer, Martin Kutrib, Giovanni Pighizzini
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`	String Assembling Systems. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2012	J	`jnl`	The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. Markus Holzer, Sebastian Jakobi, Martin Kutrib
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	J	`jnl`	Computational Complexity of NURIKABE. Fundam. Informaticae Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp
2011	J	`jnl`	Decidability of operation problems for T0L languages and subclasses. Inf. Comput. Henning Bordihn, Markus Holzer, Martin Kutrib
2011	—	`ed.`	Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings DCFS Markus Holzer, Martin Kutrib, Giovanni Pighizzini
2011	J	`jnl`	Descriptional and computational complexity of finite automata - A survey. Inf. Comput. Markus Holzer, Martin Kutrib
2011	C	`conf`	Gaining Power by Input Operations: Finite Automata and Beyond. CIAA Markus Holzer, Martin Kutrib
2011	J	`jnl`	Hairpin Finite Automata. J. Autom. Lang. Comb. Henning Bordihn, Markus Holzer, Martin Kutrib
2011	C	`conf`	Nature-Based Problems in Cellular Automata. CiE Martin Kutrib
2011	C	`conf`	Nodes Connected by Path Languages. Developments in Language Theory Markus Holzer, Martin Kutrib, Ursula Leiter
2011	C	`conf`	Nondeterministic State Complexity of Star-Free Languages. CIAA Markus Holzer, Martin Kutrib, Katja Meckel
2011	J	`jnl`	Preface. Fundam. Informaticae Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto
2011	J	`jnl`	Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. J. Autom. Lang. Comb. Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe
2011	—	`conf`	String Assembling Systems. NCMA Martin Kutrib, Matthias Wendlandt
2011	—	`conf`	The Chop of Languages. AFL Markus Holzer, Sebastian Jakobi, Martin Kutrib
2011	J	`jnl`	The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
2011	J	`jnl`	Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. Henning Bordihn, Martin Kutrib, Andreas Malcher
2010	—	`conf`	Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing Markus Holzer, Martin Kutrib
2010	J	`jnl`	Cellular automata with sparse communication. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
2010	—	`ch.`	Descriptional Complexity - An Introductory Survey. Scientific Applications of Language Methods Markus Holzer, Martin Kutrib
2010	—	`conf`	Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP Markus Holzer, Martin Kutrib
2010	—	`conf`	Measuring Communication in Cellular Automata. JAC Martin Kutrib, Andreas Malcher
2010	J	`jnl`	On Measuring Non-recursive Trade-Offs. J. Autom. Lang. Comb. Hermann Gruber, Markus Holzer, Martin Kutrib
2010	J	`jnl`	On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2010	J	`jnl`	On stateless deterministic restarting automata. Acta Informatica Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
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	C	`conf`	Reversible Pushdown Automata. LATA Martin Kutrib, Andreas Malcher
2010	—	`ed.`	Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings NCMA Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto
2010	C	`conf`	The Complexity of Regular(-Like) Expressions. Developments in Language Theory Markus Holzer, Martin Kutrib
2010	—	`conf`	The Magic Number Problem for Subregular Language Families DCFS Markus Holzer, Sebastian Jakobi, Martin Kutrib
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	—	`ch.`	Cellular Automata and Language Theory. Encyclopedia of Complexity and Systems Science Martin Kutrib
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	C	`conf`	Descriptional and Computational Complexity of Finite Automata. LATA Markus Holzer, Martin Kutrib
2009	J	`jnl`	Determination of finite automata accepting subregular languages. Theor. Comput. Sci. Henning Bordihn, Markus Holzer, Martin Kutrib
2009	J	`jnl`	More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Informaticae Hermann Gruber, Markus Holzer, Martin Kutrib
2009	J	`jnl`	Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
2009	—	`conf`	On Measuring Non-Recursive Trade-Offs DCFS Hermann Gruber, Markus Holzer, Martin Kutrib
2009	—	`conf`	On One-way One-bit O (One)-message Cellular Automata. AUTOMATA Martin Kutrib, Andreas Malcher
2009	B	`conf`	On Stateless Deterministic Restarting Automata. SOFSEM Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2009	J	`jnl`	On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib
2009	—	`conf`	On the Number of Membranes in Unary P Systems DCFS Rudolf Freund, Andreas Klein, Martin Kutrib
2009	J	`jnl`	Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Larissa Werlein
2009	J	`jnl`	Self-Assembling Finite Automata. J. Autom. Lang. Comb. Andreas Klein, Martin Kutrib
2009	C	`conf`	Undecidability of Operation Problems for T0L Languages and Subclasses. LATA Henning Bordihn, Markus Holzer, Martin Kutrib
2009	—	`ed.`	Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings NCMA Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto
2008	—	`ch.`	Cellular Automata - A Computational Point of View. New Developments in Formal Languages and Applications Martin Kutrib
2008	C	`conf`	Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib
2008	J	`jnl`	Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies. J. Cell. Autom. Martin Kutrib
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`	Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA Markus Holzer, Martin Kutrib
2008	—	`conf`	On Stateless Two-Pushdown Automata and Restarting Automata. AFL Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2008	C	`conf`	On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory Henning Bordihn, Martin Kutrib, Andreas Malcher
2008	J	`jnl`	Optimal Simulations of Weak Restarting Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Jens Reimann
2008	—	`conf`	Real-time reversible language recognition by cellular automata. Automata Martin Kutrib, Andreas Malcher
2008	—	`conf`	State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS Henning Bordihn, Markus Holzer, Martin Kutrib
2008	J	`jnl`	Succinct description of regular languages by weak restarting automata. Inf. Comput. Martin Kutrib, Jens Reimann
2008	J	`jnl`	The Boolean closure of linear context-free languages. Acta Informatica Martin Kutrib, Andreas Malcher, Detlef Wotschke
2007	J	`jnl`	Cellular Devices and Unary Languages. Fundam. Informaticae Andreas Klein, Martin Kutrib
2007	J	`jnl`	Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. Andreas Klein, Martin Kutrib
2007	J	`jnl`	Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher
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	C	`conf`	Hairpin Finite Automata. Developments in Language Theory Henning Bordihn, Markus Holzer, Martin Kutrib
2007	J	`jnl`	Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. Henning Bordihn, Markus Holzer, Martin Kutrib
2007	C	`conf`	More on the Size of Higman-Haines Sets: Effective Constructions. MCU Hermann Gruber, Markus Holzer, Martin Kutrib
2007	J	`jnl`	Non-Recursive Trade-Offs for Deterministic Restarting Automata. J. Autom. Lang. Comb. Markus Holzer, Martin Kutrib, Jens Reimann
2007	—	`conf`	Optimal Simulations of Weak Restarting Automata. DCFS Martin Kutrib, Jens Reimann
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	C	`conf`	Succinct Description of Regular Languages by Weak Restarting Automata. LATA Martin Kutrib, Jens Reimann
2007	J	`jnl`	The size of Higman-Haines sets. Theor. Comput. Sci. Hermann Gruber, Markus Holzer, Martin Kutrib
2007	J	`jnl`	When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. Martin Kutrib, 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
2006	C	`conf`	Hybrid Extended Finite Automata. CIAA Henning Bordihn, Markus Holzer, Martin Kutrib
2006	—	`conf`	The Size of Higman-Haines Sets. DCFS Markus Holzer, Martin Kutrib
2006	J	`jnl`	Variable Complexity of Simple Programs. Fundam. Informaticae Markus Holzer, Martin Kutrib
2005	—	`conf`	Descriptional Complexity of Deterministic Restarting Automata. DCFS Markus Holzer, Martin Kutrib, Jens Reimann
2005	J	`jnl`	On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. Markus Holzer, Martin Kutrib
2005	J	`jnl`	On the descriptional power of heads, counters, and pebbles. Theor. Comput. Sci. Martin Kutrib
2005	C	`conf`	Revolving-Input Finite Automata. Developments in Language Theory Henning Bordihn, Markus Holzer, Martin Kutrib
2005	J	`jnl`	The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. Martin Kutrib
2005	J	`jnl`	Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. Henning Bordihn, Markus Holzer, Martin Kutrib
2004	J	`jnl`	Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. Henning Bordihn, Markus Holzer, Martin Kutrib
2004	J	`jnl`	Foreword. IEICE Trans. Inf. Syst. Martin Kutrib, Maurice Margenstern, Hiroshi Umeo
2004	C	`conf`	Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. Developments in Language Theory Henning Bordihn, Markus Holzer, Martin Kutrib
2004	C	`conf`	Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU Markus Holzer, Martin Kutrib
2004	C	`conf`	Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA Henning Bordihn, Markus Holzer, Martin Kutrib
2004	C	`conf`	The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory Martin Kutrib, Andreas Malcher, Detlef Wotschke
2004	J	`jnl`	The Fault-Tolerant Early Bird Problem. IEICE Trans. Inf. Syst. Björn Fay, Martin Kutrib
2004	—	`conf`	The Phenomenon of Non-Recursive Trade-Offs. DCFS Martin Kutrib
2003	B	`conf`	Dimension- and Time-Hierarchies for Small Time Bounds. FCT Martin Kutrib
2003	J	`jnl`	Fast one-way cellular automata. Theor. Comput. Sci. Andreas Klein, Martin Kutrib
2003	C	`conf`	Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory Markus Holzer, Martin Kutrib
2003	A*	`conf`	Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP Markus Holzer, Martin Kutrib
2003	J	`jnl`	Foreword. Fundam. Informaticae Martin Kutrib, Maurice Margenstern, Hiroshi Umeo
2003	J	`jnl`	Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib
2003	—	`conf`	On the Descriptional Power of Heads, Counters, and Pebbles. DCFS Martin Kutrib
2003	J	`jnl`	Space- and Time-Bounded Nondeterminism for Cellular Automata. Fundam. Informaticae Martin Kutrib, Jan-Thomas Löwe
2002	J	`jnl`	Deterministic Turing machines in the range between real-time and linear-time. Theor. Comput. Sci. Andreas Klein, Martin Kutrib
2002	—	`conf`	Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS Henning Bordihn, Markus Holzer, Martin Kutrib
2002	J	`jnl`	Massively parallel fault tolerant computations on syntactical patterns. Future Gener. Comput. Syst. Martin Kutrib, Jan-Thomas Löwe
2002	J	`jnl`	On Interacting Automata with Limited Nondeterminism. Fundam. Informaticae Thomas Buchholz, Andreas Klein, Martin Kutrib
2002	J	`jnl`	Refining Nondeterminism Below Linear Time. J. Autom. Lang. Comb. Martin Kutrib
2002	Misc	`conf`	Self-Assembling Finite Automata. COCOON Andreas Klein, Martin Kutrib
2002	C	`conf`	State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA Markus Holzer, Martin Kutrib
2002	B	`conf`	String Transformation for n -Dimensional Image Compression. SOFSEM Martin Kutrib, Jan-Thomas Löwe
2002	C	`conf`	Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory Markus Holzer, Martin Kutrib
2001	B	`conf`	A Time Hierarchy for Bounded One-Way Cellular Automata. MFCS Andreas Klein, Martin Kutrib
2001	—	`conf`	Automata arrays and context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet Martin Kutrib
2001	C	`conf`	Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. MCU Martin Kutrib
2001	C	`conf`	Improving Raster Image Run-Length Encoding Using Data Order. CIAA Markus Holzer, Martin Kutrib
2001	—	`conf`	Refining Nondeterminism below Linear-Time. DCFS Martin Kutrib
2000	J	`jnl`	Deterministic Turing Machines in the Range between Real-Time and Linear-Time Electron. Colloquium Comput. Complex. Andreas Klein, Martin Kutrib
2000	—	`conf`	Fault Tolerant Parallel Pattern Recognition. ACRI Martin Kutrib, Jan-Thomas Löwe
2000	—	`conf`	Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics Thomas Buchholz, Andreas Klein, Martin Kutrib
2000	B	`conf`	Iterative Arrays with Small Time Bounds. MFCS Thomas Buchholz, Andreas Klein, Martin Kutrib
2000	B	`conf`	Massively Parallel Pattern Recognition with Link Failures. SOFSEM Martin Kutrib, Jan-Thomas Löwe
2000	—	`conf`	Real-Time Language Recognition by Alternating Cellular Automata. IFIP TCS Thomas Buchholz, Andreas Klein, Martin Kutrib
1999	B	`conf`	Iterative Arrays with a Wee Bit Alternation. FCT Thomas Buchholz, Andreas Klein, Martin Kutrib
1999	C	`conf`	On tally languages and generalized interacting automata. Developments in Language Theory Thomas Buchholz, Andreas Klein, Martin Kutrib
1999	J	`jnl`	On time reduction and simulation in cellular spaces. Int. J. Comput. Math. Thomas Buchholz, Andreas Klein, Martin Kutrib
1999	J	`jnl`	Pushdown Cellular Automata. Theor. Comput. Sci. Martin Kutrib
1998	J	`jnl`	On Time Computability of Functions in One-Way Cellular Automata. Acta Informatica Thomas Buchholz, Martin Kutrib
1998	B	`conf`	One Guess One-Way Cellular Arrays. MFCS Thomas Buchholz, Andreas Klein, Martin Kutrib
1997	J	`jnl`	Introduction to the Special Issue on Cellular Automata. Parallel Comput. Martin Kutrib, Roland Vollmar, Thomas Worsch
1997	C	`conf`	On the power of one-way bounded cellular time computers. Developments in Language Theory Thomas Buchholz, Martin Kutrib
1997	J	`jnl`	Some Relations Between Massively Parallel Arrays. Parallel Comput. Thomas Buchholz, Martin Kutrib
1996	—	`conf`	On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella Alf-Christian Achilles, Martin Kutrib, Thomas Worsch
1995	C	`conf`	Real-Time One-Way Pushdown Cellular Automata Languages. Developments in Language Theory Martin Kutrib, Jörg Richstein
1995	J	`jnl`	The Firing Squad Synchronization Problem in Defective Cellular Automata. IEICE Trans. Inf. Syst. Martin Kutrib, Roland Vollmar
1994	—	`conf`	Investigation of Different Input Modes for Cellular Automata. Parcella Martin Kutrib, Thomas Worsch
1993	—	`—`	Kellererweiterte Polyautomaten. Martin Kutrib
1991	J	`jnl`	Minimal Time Synchronization in Restricted Defective Cellular Automata. J. Inf. Process. Cybern. Martin Kutrib, Roland Vollmar