Andreas Malcher
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andreas Malcher has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Martin Kutrib
Institut für Informatik, Universität Gießen
11 shared publications - Matthias Wendlandt
Institut für Informatik, Universität Gießen
5 shared publications Matthias Wendlandt
Universität Gießen
3 shared publications- Beatrice Palano
Università degli Studi di Milano
2 shared publications - Carlo Mereghetti
Università degli Studi di Milano
2 shared publications - Holger Bock Axelsen
University of Copenhagen
2 shared publications
Latest Publications
- 25 May 2018
- Published by Springer Nature
- p. 100-112
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication
- 25 May 2018
- Published by Springer Nature
- p. 100-112
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication
- 27 February 2018
- Published by Springer Nature
- p. 129-168
Cellular Automata: Descriptional Complexity and Decidability
- 27 February 2018
- Published by Springer Nature
- p. 129-168
Cellular Automata: Descriptional Complexity and Decidability
- Open Access
- 6 May 2017
- Published by Springer Nature
- p. 139-150
Fast One-Way Cellular Automata with Reversible Mealy Cells
- 6 May 2017
- Published by Springer Nature
- p. 139-150
Open AccessFast One-Way Cellular Automata with Reversible Mealy Cells
- 16 September 2016
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 50 (4) , 313-330
When input-driven pushdown automata meet reversiblity
We investigate subfamilies of context-free languages that share two important properties. The languages are accepted by input-driven pushdown automata as well as by a reversible pushdown automata. So, the languages are input driven and reversible at the same time. This intersection can be defined on the underlying language families or on the underlying machine classes. It turns out that the latter class is properly included in the former. The relationships between the language families obtained in this way and to reversible context-free languages as well as to input-driven languages are studied. In general, a hierarchical inclusion structure within the real-time deterministic context-free languages is obtained. Finally, the closure properties of these families under the standard operations are investigated and it turns out that all language families introduced are anti-AFLs.
- 16 September 2016
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 50 (4) , 313-330
When input-driven pushdown automata meet reversiblity
We investigate subfamilies of context-free languages that share two important properties. The languages are accepted by input-driven pushdown automata as well as by a reversible pushdown automata. So, the languages are input driven and reversible at the same time. This intersection can be defined on the underlying language families or on the underlying machine classes. It turns out that the latter class is properly included in the former. The relationships between the language families obtained in this way and to reversible context-free languages as well as to input-driven languages are studied. In general, a hierarchical inclusion structure within the real-time deterministic context-free languages is obtained. Finally, the closure properties of these families under the standard operations are investigated and it turns out that all language families introduced are anti-AFLs.
- 30 June 2016
- Published by Springer Nature
- p. 89-104
Boosting Reversible Pushdown Machines by Preprocessing
- 30 June 2016
- Published by Springer Nature
- p. 89-104
Boosting Reversible Pushdown Machines by Preprocessing
- Open Access
- 28 June 2016
- Published by Springer Nature
- p. 138-152
Descriptional Complexity of Bounded Regular Languages
- 28 June 2016
- Published by Springer Nature
- p. 138-152
Open AccessDescriptional Complexity of Bounded Regular Languages
- 26 February 2016
- Published by Springer Nature
- p. 156-167
Input-Driven Queue Automata with Internal Transductions
- 26 February 2016
- Published by Springer Nature
- p. 156-167
Input-Driven Queue Automata with Internal Transductions