Andreas Malcher

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 63

Top Venues

NCMA

Int. J. Found. Comput. Sci.

DCFS

Theor. Comput. Sci.

Goethe University Frankfurt, Frankfurt am Main, Germany (PHD)

Education History

Goethe University Frankfurt, Frankfurt am Main, Germany

PHD

Publications

Martin Kutrib, Andreas Malcher
Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. 58 (2024)
Martin Kutrib, Andreas Malcher
Cellular Automata: Communication Matters. CiE (2024)
Martin Kutrib, Andreas Malcher
Cellular Automata: From Black-and-White to High Gloss Color. DLT (2024)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. 996 (2024)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
Deterministic Pushdown Automata with Translucent Input Letters. DLT (2024)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969 (2023)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28 (1-3) (2023)
Martin Kutrib, Andreas Malcher
Reversible Two-Party Computations. AFL (2023)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Complexity of Exclusive Nondeterministic Finite Automata. DCFS (2023)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA (2022)
Martin Kutrib, Andreas Malcher
One-dimensional pattern generation by cellular automata. Nat. Comput. 21 (3) (2022)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher
Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. 27 (1-3) (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185 (4) (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284 (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR (2022)
Martin Kutrib, Andreas Malcher, Christian Schneider
Finite automata with undirected state graphs. Acta Informatica 59 (1) (2022)
Martin Kutrib, Andreas Malcher
Iterative arrays with finite inter-cell communication. Nat. Comput. 21 (1) (2022)
Martin Kutrib, Andreas Malcher
Reversible Computations of One-Way Counter Automata. NCMA (2022)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Martin Kutrib, Andreas Malcher
Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. 55 (2021)
Henning Fernau, Andreas Malcher, Giovanni Pighizzini
Preface to Martin Kutrib Festschrift. Acta Informatica 58 (4) (2021)
Andreas Malcher
Decidability Questions for Insertion Systems and Related Models. Fundam. Informaticae 180 (1-2) (2021)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-driven multi-counter automata. Theor. Comput. Sci. 870 (2021)
Martin Kutrib, Andreas Malcher
String Generation by Cellular Automata. Complex Syst. 30 (2) (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Transduction on Unary Languages. ICTCS (2021)
Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
Reversible pushdown transducers. Inf. Comput. 281 (2021)
Andreas Malcher
Hierarchies and undecidability results for iterative arrays with sparse communication. Nat. Comput. 19 (4) (2020)
Martin Kutrib, Andreas Malcher
One-Dimensional Pattern Generation by Cellular Automata. ACRI (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS (2020)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. 31 (8) (2020)
Martin Kutrib, Andreas Malcher
Cellular String Generators. Automata (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers. ICTCS (2019)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787 (2019)
Martin Kutrib, Andreas Malcher
Iterative Arrays with Finite Inter-cell Communication. Automata (2019)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS (2019)
Martin Kutrib, Andreas Malcher
Digging input-driven pushdown automata. NCMA (2019)
Andreas Malcher
Report on DCFS 2019. Bull. EATCS 129 (2019)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Multi-counter Automata. CIAA (2019)
Martin Kutrib, Andreas Malcher, Christian Schneider
Finite Automata with Undirected State Graphs. DCFS (2018)
Andreas Malcher
Report on DCFS 2018. Bull. EATCS 126 (2018)
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Diving into the queue. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Andreas Malcher
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication. Automata (2018)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Pushdown and Queue Machines by Preprocessing. CIAA (2018)
Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
Reversible Pushdown Transducers. DLT (2018)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Shrinking one-way cellular automata. Nat. Comput. 16 (3) (2017)
Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. 22 (1-3) (2017)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. AFL (2017)
Martin Kutrib, Andreas Malcher
One-way reversible multi-head finite automata. Theor. Comput. Sci. 682 (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae 155 (1-2) (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA (2017)
Andreas Malcher
Decidability questions for insertion systems. NCMA (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Transducing Reversibly with Finite State Machines. CIAA (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher
Reversible Shrinking Two-Pushdown Automata. LATA (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Queue Automata with Internal Transductions. LATA (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Reversible Queue Automata. Fundam. Informaticae 148 (3-4) (2016)
Martin Kutrib, Andreas Malcher
Iterative Arrays with Set Storage. J. Cell. Autom. 12 (1-2) (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Set Automata. Int. J. Found. Comput. Sci. 27 (2) (2016)
Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Descriptional Complexity of Bounded Regular Languages. DCFS (2016)
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Diving into the queue. NCMA (2016)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Reversible Pushdown Machines by Preprocessing. RC (2016)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578 (2015)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. 26 (8) (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
When input-driven pushdown automata meet reversibility. NCMA (2015)
Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher
A Hierarchy of Fast Reversible Turing Machines. RC (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Shrinking One-Way Cellular Automata. Automata (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Tinput-Driven Pushdown Automata. MCU (2015)
Jarkko Kari, Martin Kutrib, Andreas Malcher
Preface. J. Cell. Autom. 9 (5-6) (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. 25 (7) (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Deterministic Set Automata. Developments in Language Theory (2014)
Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. 237 (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Real-Time Reversible One-Way Cellular Automata. Automata (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Reversible queue automata. NCMA (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Head and state hierarchies for unary multi-head finite automata. Acta Informatica 51 (8) (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Regularity and Size of Set Automata. DCFS (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. 25 (8) (2014)
Martin Kutrib, Andreas Malcher
Measuring Communication in Automata Systems - (Invited Paper). Developments in Language Theory (2014)
Martin Kutrib, Andreas Malcher
Iterative Arrays with Set Storage. ACRI (2014)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Measuring Communication in Parallel Communicating Finite Automata. AFL (2014)
Andreas Malcher, Giovanni Pighizzini
Descriptional complexity of bounded context-free languages. Inf. Comput. 227 (2013)
Martin Kutrib, Andreas Malcher
One-Dimensional Cellular Automaton Transducers. Fundam. Informaticae 126 (2-3) (2013)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory (2013)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Size of Unary One-Way Multi-head Finite Automata. DCFS (2013)
Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS (2013)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA (2013)
Henning Bordihn, Martin Kutrib, Andreas Malcher
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23 (3) (2012)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory (2012)
Martin Kutrib, Andreas Malcher
One-Way Reversible Multi-head Finite Automata. RC (2012)
Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher
Input-Driven Stack Automata. IFIP TCS (2012)
Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN (2012)
Martin Kutrib, Andreas Malcher
Reversible pushdown automata. J. Comput. Syst. Sci. 78 (6) (2012)
Martin Kappes, Andreas Malcher, Detlef Wotschke
In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23 (1) (2012)
Martin Kutrib, Andreas Malcher
Transductions Computed by One-Dimensional Cellular Automata AUTOMATA & JAC (2012)
Andreas Malcher
Report from DCFS 2012. Bull. EATCS 108 (2012)
Martin Kutrib, Andreas Malcher
Iterative Arrays: Little Resources Big Size Impact. ACRI (2012)
Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. 17 (2-4) (2012)
Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Pushdown Store Languages. DCFS (2012)
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
First-order logics: some characterizations and closure properties. Acta Informatica 49 (4) (2012)

Andreas Malcher.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Malcher