| Publication | Date of Publication | Type |
|---|
| 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 |
| Sweeping input-driven pushdown automata | 2024-02-28 | Paper |
| Iterative arrays with finite inter-cell communication | 2024-02-16 | Paper |
| Iterative arrays with self-verifying communication cell | 2024-02-16 | 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/Q6190885 | 2024-02-06 | Paper |
| Revisiting the cutting of the firing squad synchronization | 2023-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070604 | 2023-11-23 | Paper |
| Tree-walking-storage automata | 2023-11-16 | 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 |
| Reversible Top-Down Syntax Analysis | 2023-08-15 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2023-08-01 | Paper |
| Self-verifying Cellular Automata | 2023-06-30 | Paper |
| Syntax checking either way | 2023-06-21 | Paper |
| State complexity of finite partial languages | 2023-06-21 | Paper |
| State complexity of finite partial languages | 2023-01-18 | Paper |
| Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power | 2022-12-16 | Paper |
| Optimizing reversible programs | 2022-11-11 | Paper |
| State complexity of partial word finite automata | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867516 | 2022-09-14 | Paper |
| Syntax checking either way | 2022-08-16 | 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 |
| String assembling systems: comparison to sticker systems and decidability | 2022-07-06 | Paper |
| Cellular Automata and Language Theory | 2022-04-28 | Paper |
| Finite automata with undirected state graphs | 2022-04-01 | Paper |
| Reversible top-down syntax analysis | 2022-03-25 | Paper |
| One-dimensional pattern generation by cellular automata | 2022-03-24 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2022-03-24 | Paper |
| Boolean kernels of context-free languages | 2022-03-22 | Paper |
| Descriptional complexity of iterated uniform finite-state transducers | 2022-03-14 | Paper |
| Descriptional complexity of regular languages | 2022-02-04 | Paper |
| Digging input-driven pushdown automata | 2022-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016357 | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016364 | 2021-12-13 | Paper |
| Reversible pushdown transducers | 2021-11-25 | Paper |
| Self-Verifying Pushdown and Queue Automata | 2021-11-15 | Paper |
| Two-Sided Strictly Locally Testable Languages | 2021-11-15 | Paper |
| Compiling Janus to RSSA | 2021-11-03 | Paper |
| String Generation by Cellular Automata | 2021-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5010359 | 2021-08-25 | 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/Q4988162 | 2021-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4988164 | 2021-05-12 | 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/Q4964015 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146520 | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146524 | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146526 | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145152 | 2021-01-20 | Paper |
| Multi-stranded string assembling systems | 2020-10-22 | Paper |
| Kernels of Sub-classes of Context-Free Languages | 2020-07-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 |
| Non-recursive trade-offs are ``almost everywhere | 2020-05-12 | 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 |
| One-Time Nondeterministic Computations | 2019-12-10 | Paper |
| Iterative arrays with finite inter-cell communication | 2019-12-05 | Paper |
| Iterative arrays with self-verifying communication cell | 2019-12-05 | Paper |
| Transducing reversibly with finite state machines | 2019-08-20 | Paper |
| Diving into the queue | 2019-07-18 | Paper |
| Expressive capacity of subregular expressions | 2019-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967154 | 2019-07-03 | Paper |
| Operational State Complexity and Decidability of Jumping Finite Automata | 2019-06-24 | Paper |
| Reversible pushdown transducers | 2018-11-22 | Paper |
| Boosting pushdown and queue machines by preprocessing | 2018-11-07 | Paper |
| Parametrizing string assembling systems | 2018-11-07 | Paper |
| Structure and Complexity of Some Subregular Language Families | 2018-09-20 | Paper |
| Cutting the Firing Squad Synchronization | 2018-07-06 | Paper |
| Minimal Reversible Deterministic Finite Automata | 2018-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4609329 | 2018-03-29 | Paper |
| Descriptional complexity of limited automata | 2018-03-21 | Paper |
| Reversible nondeterministic finite automata | 2018-03-16 | Paper |
| Fast one-way cellular automata with reversible Mealy cells | 2018-03-08 | Paper |
| The Degree of Irreversibility in Deterministic Finite Automata | 2018-02-22 | Paper |
| Deterministic Stack Transducers | 2018-02-22 | Paper |
| Reversible Limited Automata | 2018-01-19 | Paper |
| Tinput-Driven Pushdown, Counter, and Stack Automata | 2018-01-19 | Paper |
| Reversible Queue Automata | 2017-11-09 | Paper |
| Operational state complexity and decidability of jumping finite automata | 2017-10-13 | Paper |
| One-time nondeterministic computations | 2017-08-31 | Paper |
| Transducing reversibly with finite state machines | 2017-08-22 | Paper |
| Concatenation-free languages | 2017-06-19 | Paper |
| The chop of languages | 2017-06-15 | Paper |
| One-way reversible multi-head finite automata | 2017-06-15 | Paper |
| When input-driven pushdown automata meet reversiblity | 2017-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507056 | 2016-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507063 | 2016-12-16 | Paper |
| Descriptional Complexity of Bounded Regular Languages | 2016-11-09 | Paper |
| The Degree of Irreversibility in Deterministic Finite Automata | 2016-11-09 | Paper |
| Deterministic Stack Transducers | 2016-11-09 | Paper |
| A Hierarchy of Fast Reversible Turing Machines | 2016-09-30 | Paper |
| On Measuring Non-Recursive Trade-Offs | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819385 | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819402 | 2016-09-29 | Paper |
| Boosting Reversible Pushdown Machines by Preprocessing | 2016-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740421 | 2016-07-26 | Paper |
| Set Automata | 2016-06-23 | Paper |
| On One-way One-bit O (One)-message Cellular Automata | 2016-06-09 | Paper |
| Deterministic One-Way Turing Machines with Sublinear Space | 2016-05-11 | Paper |
| Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities | 2016-04-15 | Paper |
| Input-Driven Queue Automata with Internal Transductions | 2016-04-13 | Paper |
| Reversible Shrinking Two-Pushdown Automata | 2016-04-13 | Paper |
| One-Way Reversible Multi-head Finite Automata | 2015-11-30 | Paper |
| Minimal Reversible Deterministic Finite Automata | 2015-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3450011 | 2015-11-02 | Paper |
| Expressive Capacity of Concatenation Freeness | 2015-09-23 | Paper |
| Reversible and Irreversible Computations of Deterministic Finite-State Devices | 2015-09-16 | Paper |
| Tinput-Driven Pushdown Automata | 2015-09-15 | Paper |
| Reversible Limited Automata | 2015-09-15 | Paper |
| Aspects of Reversibility for Classical Automata | 2015-09-08 | Paper |
| Shrinking One-Way Cellular Automata | 2015-08-07 | Paper |
| On Simulation Cost of Unary Limited Automata | 2015-08-07 | Paper |
| Complexity of One-Way Cellular Automata | 2015-08-04 | 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 |
| Complexity of Operation Problems | 2015-02-25 | Paper |
| SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA | 2015-02-09 | Paper |
| Parameterized Prefix Distance between Regular Languages | 2015-01-13 | 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 |
| Degrees of Reversibility for DFA and DPDA | 2014-09-02 | Paper |
| Bidirectional string assembling systems | 2014-08-22 | Paper |
| Regularity and Size of Set Automata | 2014-08-07 | Paper |
| Oblivious two-way finite automata: decidability and complexity | 2014-07-18 | Paper |
| ω-rational Languages: High Complexity Classes vs. Borel Hierarchy | 2014-03-31 | Paper |
| ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA | 2014-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747094 | 2014-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396372 | 2014-02-05 | Paper |
| Non-deterministic cellular automata and languages | 2014-01-06 | Paper |
| Time-Symmetric Machines | 2013-12-17 | 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 |
| String Assembling Systems | 2012-11-22 | Paper |
| Reversible pushdown automata | 2012-11-06 | Paper |
| States and Heads Do Count for Unary Multi-head Finite Automata | 2012-11-02 | Paper |
| On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata | 2012-11-01 | Paper |
| Input-Driven Stack Automata | 2012-09-21 | Paper |
| On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata | 2012-09-20 | Paper |
| THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES | 2012-08-30 | Paper |
| ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA | 2012-08-30 | Paper |
| THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS | 2012-08-29 | Paper |
| UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA | 2012-08-29 | Paper |
| Nondeterministic state complexity of star-free languages | 2012-08-09 | Paper |
| Oblivious Two-Way Finite Automata: Decidability and Complexity | 2012-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3102144 | 2011-12-01 | Paper |
| Computational Complexity of NURIKABE | 2011-11-22 | Paper |
| Nature-Based Problems in Cellular Automata | 2011-09-09 | Paper |
| Nodes Connected by Path Languages | 2011-07-29 | Paper |
| Gaining Power by Input Operations: Finite Automata and Beyond | 2011-07-29 | Paper |
| Nondeterministic State Complexity of Star-Free Languages | 2011-07-29 | Paper |
| Decidability of operation problems for T0L languages and subclasses | 2011-07-27 | Paper |
| Descriptional and computational complexity of finite automata -- a survey | 2011-07-27 | Paper |
| Cellular automata with limited inter-cell bandwidth | 2011-07-18 | Paper |
| String Transformation for n-Dimensional Image Compression | 2011-04-01 | Paper |
| Two-Party Watson-Crick Computations | 2011-02-11 | Paper |
| Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction | 2011-01-21 | Paper |
| Complexity of multi-head finite automata: origins and directions | 2011-01-10 | Paper |
| On stateless deterministic restarting automata | 2010-12-13 | Paper |
| ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA | 2010-11-11 | Paper |
| Cellular automata with sparse communication | 2010-10-07 | Paper |
| The Complexity of Regular(-Like) Expressions | 2010-08-31 | Paper |
| Undecidability and Hierarchy Results for Parallel Communicating Finite Automata | 2010-08-31 | Paper |
| Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata | 2010-08-31 | Paper |
| Reversible Pushdown Automata | 2010-05-26 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Real-time reversible iterative arrays | 2010-02-09 | Paper |
| CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS | 2010-01-29 | Paper |
| WHEN CHURCH-ROSSER BECOMES CONTEXT FREE | 2010-01-29 | Paper |
| On input-revolving deterministic and nondeterministic finite automata | 2009-11-27 | Paper |
| Regulated nondeterminism in pushdown automata | 2009-09-14 | Paper |
| NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY | 2009-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5192991 | 2009-08-10 | Paper |
| Determination of finite automata accepting subregular languages | 2009-08-07 | Paper |
| Cellular Automata with Sparse Communication | 2009-07-09 | Paper |
| More on the Size of Higman-Haines Sets: Effective Constructions | 2009-06-23 | Paper |
| Descriptional and Computational Complexity of Finite Automata | 2009-04-02 | Paper |
| Undecidability of Operation Problems for T0L Languages and Subclasses | 2009-04-02 | Paper |
| Context-Dependent Nondeterminism for Pushdown Automata | 2009-03-26 | Paper |
| More on the Size of Higman-Haines Sets: Effective Constructions | 2009-03-05 | Paper |
| Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity | 2009-02-12 | Paper |
| On Stateless Deterministic Restarting Automata | 2009-02-03 | Paper |
| Deterministic Input-Reversal and Input-Revolving Finite Automata | 2008-11-20 | 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 |
| Succinct description of regular languages by weak restarting automata | 2008-10-08 | Paper |
| OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3527018 | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517104 | 2008-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3511728 | 2008-07-11 | Paper |
| The Boolean closure of linear context-free languages | 2008-06-17 | Paper |
| Regulated Nondeterminism in Pushdown Automata | 2008-06-10 | Paper |
| HYBRID EXTENDED FINITE AUTOMATA | 2008-05-20 | Paper |
| Real-Time Reversible Iterative Arrays | 2008-02-26 | Paper |
| The size of Higman-Haines sets | 2007-12-19 | Paper |
| Hairpin Finite Automata | 2007-11-28 | Paper |
| Finite turns and the regular closure of linear context-free languages | 2007-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3592204 | 2007-09-12 | Paper |
| Hybrid Extended Finite Automata | 2007-09-06 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3416094 | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485970 | 2006-09-06 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS | 2005-11-14 | Paper |
| NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313783 | 2005-09-01 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES | 2005-08-01 | Paper |
| On the descriptional complexity of finite automata with modified acceptance conditions | 2005-02-22 | Paper |
| On the descriptional power of heads, counters, and pebbles | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825678 | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808651 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472003 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4465338 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452076 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449198 | 2004-02-08 | Paper |
| Fast one-way cellular automata. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418610 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412577 | 2003-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412108 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799364 | 2003-03-19 | Paper |
| Deterministic Turing machines in the range between real-time and linear-time. | 2003-01-21 | Paper |
| Massively parallel fault tolerant computations on syntactical patterns | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782102 | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536427 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779163 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536360 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530004 | 2002-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708975 | 2001-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934326 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321603 | 2000-06-21 | Paper |
| On time reduction and simulation in cellular spaces | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218155 | 1999-06-21 | Paper |
| Pushdown cellular automata | 1999-04-28 | Paper |
| On time computability of functions in one-way cellular automata | 1998-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4855406 | 1995-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357556 | 1991-01-01 | Paper |
