| Publication | Date of Publication | Type |
|---|
| On properties of languages accepted by deterministic pushdown automata with translucent input letters | 2025-01-20 | Paper |
| Reversible Computations of One-Way Counter Automata | 2024-04-16 | Paper |
| Reversible Two-Party Computations | 2024-04-09 | Paper |
| On the power of pushing or stationary moves for input-driven pushdown automata | 2024-04-04 | Paper |
| Iterative arrays with finite inter-cell communication | 2024-02-16 | Paper |
| Hierarchies and undecidability results for iterative arrays with sparse communication | 2024-02-09 | Paper |
| Shrinking one-way cellular automata | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6190438 | 2024-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070604 | 2023-11-23 | Paper |
| One-dimensional pattern generation by cellular automata | 2023-09-01 | Paper |
| Complexity of exclusive nondeterministic finite automata | 2023-08-17 | Paper |
| Input-Driven Double-Head Pushdown Automata | 2023-08-15 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2023-08-01 | Paper |
| Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power | 2022-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867516 | 2022-09-14 | Paper |
| On the power of pushing or stationary moves for input-driven pushdown automata | 2022-08-16 | Paper |
| Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* | 2022-07-14 | Paper |
| Finite automata with undirected state graphs | 2022-04-01 | Paper |
| One-dimensional pattern generation by cellular automata | 2022-03-24 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2022-03-24 | Paper |
| Descriptional complexity of iterated uniform finite-state transducers | 2022-03-14 | Paper |
| Digging input-driven pushdown automata | 2022-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016364 | 2021-12-13 | Paper |
| Reversible pushdown transducers | 2021-11-25 | Paper |
| Decidability Questions for Insertion Systems and Related Models | 2021-11-15 | Paper |
| String Generation by Cellular Automata | 2021-09-08 | Paper |
| Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion | 2021-07-14 | Paper |
| Cellular string generators | 2021-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994939 | 2021-06-22 | Paper |
| Input-driven multi-counter automata | 2021-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986316 | 2021-04-27 | Paper |
| Boosting Reversible Pushdown and Queue Machines by Preprocessing | 2021-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964006 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146526 | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145152 | 2021-01-20 | Paper |
| Finite automata with undirected state graphs | 2020-06-30 | Paper |
| Cellular Automata: Descriptional Complexity and Decidability | 2020-05-28 | Paper |
| Queue Automata: Foundations and Developments | 2020-05-28 | Paper |
| Descriptional complexity of iterated uniform finite-state transducers | 2020-05-12 | Paper |
| Input-driven multi-counter automata | 2020-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5219753 | 2020-03-12 | Paper |
| Iterative arrays with finite inter-cell communication | 2019-12-05 | Paper |
| Transducing reversibly with finite state machines | 2019-08-20 | Paper |
| Diving into the queue | 2019-07-18 | Paper |
| Reversible pushdown transducers | 2018-11-22 | Paper |
| Boosting pushdown and queue machines by preprocessing | 2018-11-07 | Paper |
| Hierarchies and undecidability results for iterative arrays with sparse communication | 2018-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4609329 | 2018-03-29 | Paper |
| Fast one-way cellular automata with reversible Mealy cells | 2018-03-08 | Paper |
| Tinput-Driven Pushdown, Counter, and Stack Automata | 2018-01-19 | Paper |
| Reversible Queue Automata | 2017-11-09 | Paper |
| Transducing reversibly with finite state machines | 2017-08-22 | Paper |
| One-way reversible multi-head finite automata | 2017-06-15 | Paper |
| When input-driven pushdown automata meet reversiblity | 2017-03-24 | Paper |
| Descriptional Complexity of Bounded Regular Languages | 2016-11-09 | Paper |
| A Hierarchy of Fast Reversible Turing Machines | 2016-09-30 | Paper |
| One-way cellular automata, bounded languages, and minimal communication | 2016-09-29 | Paper |
| Boosting Reversible Pushdown Machines by Preprocessing | 2016-08-10 | Paper |
| Set automata | 2016-06-23 | Paper |
| On one-way one-bit \(O\) (one)-message cellular automata | 2016-06-09 | Paper |
| Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities | 2016-04-15 | Paper |
| Reversible Shrinking Two-Pushdown Automata | 2016-04-13 | Paper |
| Input-Driven Queue Automata with Internal Transductions | 2016-04-13 | Paper |
| One-Way Reversible Multi-head Finite Automata | 2015-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3450011 | 2015-11-02 | Paper |
| Tinput-Driven Pushdown Automata | 2015-09-15 | Paper |
| Shrinking One-Way Cellular Automata | 2015-08-07 | Paper |
| Real-Time Reversible One-Way Cellular Automata | 2015-08-04 | Paper |
| Deterministic input-driven queue automata: finite turns, decidability, and closure properties | 2015-05-18 | Paper |
| STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES | 2015-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178456 | 2015-03-16 | Paper |
| SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA | 2015-02-09 | Paper |
| Head and state hierarchies for unary multi-head finite automata | 2014-12-03 | Paper |
| Measuring Communication in Automata Systems | 2014-10-14 | Paper |
| Deterministic Set Automata | 2014-10-14 | Paper |
| Regularity and Size of Set Automata | 2014-08-07 | Paper |
| Oblivious two-way finite automata: decidability and complexity | 2014-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747094 | 2014-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396372 | 2014-02-05 | Paper |
| Descriptional complexity of bounded context-free languages | 2013-12-04 | Paper |
| A Direct Construction of Finite State Automata for Pushdown Store Languages | 2013-08-09 | Paper |
| Size of Unary One-Way Multi-head Finite Automata | 2013-08-09 | Paper |
| Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties | 2013-08-07 | Paper |
| One-Way Multi-Head Finite Automata with Pebbles But No States | 2013-06-28 | Paper |
| Reversible pushdown automata | 2012-11-06 | Paper |
| Descriptional Complexity of Pushdown Store Languages | 2012-11-02 | Paper |
| States and Heads Do Count for Unary Multi-head Finite Automata | 2012-11-02 | Paper |
| First-order logics: some characterizations and closure properties | 2012-10-15 | Paper |
| Input-Driven Stack Automata | 2012-09-21 | Paper |
| In memoriam Chandra Kintala | 2012-08-30 | Paper |
| On the computational capacity of parallel communicating finite automata | 2012-08-30 | Paper |
| Undecidability and hierarchy results for parallel communicating finite automata | 2012-08-29 | Paper |
| Descriptional complexity of two-way pushdown automata with restricted head reversals | 2012-08-13 | Paper |
| Oblivious Two-Way Finite Automata: Decidability and Complexity | 2012-06-29 | Paper |
| Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals | 2011-07-29 | Paper |
| Cellular automata with limited inter-cell bandwidth | 2011-07-18 | Paper |
| Two-Party Watson-Crick Computations | 2011-02-11 | Paper |
| Complexity of multi-head finite automata: origins and directions | 2011-01-10 | Paper |
| SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS | 2010-11-11 | Paper |
| Cellular automata with sparse communication | 2010-10-07 | Paper |
| Computations and decidability of iterative arrays with restricted communication | 2010-09-29 | Paper |
| Undecidability and Hierarchy Results for Parallel Communicating Finite Automata | 2010-08-31 | Paper |
| Reversible Pushdown Automata | 2010-05-26 | Paper |
| On the Expressive Power of FO[ + ] | 2010-05-26 | Paper |
| Real-time reversible iterative arrays | 2010-02-09 | Paper |
| ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS | 2010-01-29 | Paper |
| WHEN CHURCH-ROSSER BECOMES CONTEXT FREE | 2010-01-29 | Paper |
| Regulated nondeterminism in pushdown automata | 2009-09-14 | Paper |
| Cellular Automata with Sparse Communication | 2009-07-09 | Paper |
| Context-Dependent Nondeterminism for Pushdown Automata | 2009-03-26 | Paper |
| On the Computational Capacity of Parallel Communicating Finite Automata | 2008-10-30 | Paper |
| Fast reversible language recognition using cellular automata | 2008-10-08 | Paper |
| DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517107 | 2008-08-12 | Paper |
| The Boolean closure of linear context-free languages | 2008-06-17 | Paper |
| Regulated Nondeterminism in Pushdown Automata | 2008-06-10 | Paper |
| Real-Time Reversible Iterative Arrays | 2008-02-26 | Paper |
| Descriptional Complexity of Bounded Context-Free Languages | 2007-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422234 | 2007-10-17 | Paper |
| Finite turns and the regular closure of linear context-free languages | 2007-09-21 | Paper |
| Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability | 2007-09-05 | Paper |
| Context-dependent nondeterminism for pushdown automata | 2007-05-11 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| On two-way communication in cellular automata with a fixed number of cells | 2005-02-22 | Paper |
| Minimizing finite automata is computationally hard | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825681 | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4465339 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452078 | 2004-02-11 | Paper |
