Matthias Wendlandt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthias Wendlandt 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
23 shared publications - Andreas Malcher
Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392 Giessen, Germany
7 shared publications - Andreas Malcher
Universität Gießen
5 shared publications - Priscilla Raucci
Universität Gießen
5 shared publications - Beatrice Palano
Università degli Studi di Milano
3 shared publications - Carlo Mereghetti
Università degli Studi di Milano
3 shared publications
Latest Publications
- Open Access
- 8 September 2026
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 60, 35
Input-Driven Pushdown Automata with Translucent Input Letters
Input-driven pushdown automata with translucent input letters are investigated. Here, the use of translucent input letters means that the input is processed in several sweeps and that, depending on the current state of the automaton, some input symbols are visible and can be processed, whereas some other symbols are invisible, and may be processed in another sweep. Additionally, the returning mode as well as the non-returning mode are considered, where in the former mode a new sweep must start after processing a visible input symbol. Input-driven pushdown automata differ from traditional pushdown automata by the fact that the actions on the pushdown store (push, pop, nothing) are dictated by the input symbols. We obtain the result that the input-driven nondeterministic model is computationally stronger than the deterministic model both in the returning mode and in the non-returning mode, whereas it is known that the deterministic and the nondeterministic model are equivalent for input-driven pushdown automata without translucency. It also turns out that the non-returning model is computationally stronger than the returning model both in the deterministic and the nondeterministic case. Furthermore, we investigate the closure properties of the language families introduced under the Boolean operations. We obtain a complete picture in the deterministic case and an almost complete picture in the nondeterministic case. Finally, we look at decidability questions and obtain the non-semidecidability of the questions of universality, inclusion, equivalence, and regularity in the nondeterministic case.
- 8 September 2026
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 60, 35
Open AccessInput-Driven Pushdown Automata with Translucent Input Letters
Input-driven pushdown automata with translucent input letters are investigated. Here, the use of translucent input letters means that the input is processed in several sweeps and that, depending on the current state of the automaton, some input symbols are visible and can be processed, whereas some other symbols are invisible, and may be processed in another sweep. Additionally, the returning mode as well as the non-returning mode are considered, where in the former mode a new sweep must start after processing a visible input symbol. Input-driven pushdown automata differ from traditional pushdown automata by the fact that the actions on the pushdown store (push, pop, nothing) are dictated by the input symbols. We obtain the result that the input-driven nondeterministic model is computationally stronger than the deterministic model both in the returning mode and in the non-returning mode, whereas it is known that the deterministic and the nondeterministic model are equivalent for input-driven pushdown automata without translucency. It also turns out that the non-returning model is computationally stronger than the returning model both in the deterministic and the nondeterministic case. Furthermore, we investigate the closure properties of the language families introduced under the Boolean operations. We obtain a complete picture in the deterministic case and an almost complete picture in the nondeterministic case. Finally, we look at decidability questions and obtain the non-semidecidability of the questions of universality, inclusion, equivalence, and regularity in the nondeterministic case.
- 17 July 2026
- Published by Springer Nature
- p. 110-121
State-Limited Inductive Inference of Cellular Automata
- 17 July 2026
- Published by Springer Nature
- p. 110-121
State-Limited Inductive Inference of Cellular Automata
- Open Access
- 13 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1072
On properties of languages accepted by deterministic pushdown automata with translucent input letters
- 13 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1072
Open AccessOn properties of languages accepted by deterministic pushdown automata with translucent input letters
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 229-243
Subregular Expressions with Two Operations
- 17 August 2025
- Published by Springer Nature
- p. 229-243
Open AccessSubregular Expressions with Two Operations
- 3 September 2024
- Published by Springer Nature
- p. 208-220
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
- 3 September 2024
- Published by Springer Nature
- p. 208-220
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
- 27 July 2024
- Published by Springer Nature
- p. 203-217
Deterministic Pushdown Automata with Translucent Input Letters
- 27 July 2024
- Published by Springer Nature
- p. 203-217
Deterministic Pushdown Automata with Translucent Input Letters
- 24 June 2023
- Published by Springer Nature
- p. 121-133
Complexity of Exclusive Nondeterministic Finite Automata
- 24 June 2023
- Published by Springer Nature
- p. 121-133
Complexity of Exclusive Nondeterministic Finite Automata
- 22 August 2022
- Published by Springer Nature
- p. 170-183
State Complexity of Finite Partial Languages
- Open Access
- 20 August 2022
- Published by Springer Nature in Natural Computing
- Vol. 23 (1) , 131-156
Variants of string assembling systems
String assembling systems are biologically inspired mechanisms that generate strings from copies out of finite sets of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction of assembly units that may appear at the beginning, during, or at the end of the assembling process and by a length restriction on the units. We investigate the power of these model-inherent control mechanisms by considering variants where one or more of these mechanisms are relaxed. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that the power gained in the different control mechanisms may yield strictly more powerful systems and incomparable capacities. Additionally, we generalize these systems to multi-stranded systems. We obtain a strong connection to one-way multi-head finite automata and show an infinite, dense, and strict strand hierarchy. Finally, we examine the closure properties of the different variants of string assembling systems.
- 20 August 2022
- Published by Springer Nature in Natural Computing
- Vol. 23 (1) , 131-156
Open AccessVariants of string assembling systems
String assembling systems are biologically inspired mechanisms that generate strings from copies out of finite sets of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction of assembly units that may appear at the beginning, during, or at the end of the assembling process and by a length restriction on the units. We investigate the power of these model-inherent control mechanisms by considering variants where one or more of these mechanisms are relaxed. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that the power gained in the different control mechanisms may yield strictly more powerful systems and incomparable capacities. Additionally, we generalize these systems to multi-stranded systems. We obtain a strong connection to one-way multi-head finite automata and show an infinite, dense, and strict strand hierarchy. Finally, we examine the closure properties of the different variants of string assembling systems.