| Iterative arrays with self-verifying communication cell | 0 | 0.34 | 2022 |
| Optimizing Reversible Programs | 0 | 0.34 | 2022 |
| Descriptional complexity of iterated uniform finite-state transducers | 0 | 0.34 | 2022 |
| Reversible Shrinking Two-Pushdown Automata. | 0 | 0.34 | 2022 |
| One-dimensional pattern generation by cellular automata | 0 | 0.34 | 2022 |
| Reversible pushdown transducers | 0 | 0.34 | 2021 |
| Cellular String Generators. | 0 | 0.34 | 2020 |
| Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers - Computational and Descriptional Power. | 0 | 0.34 | 2020 |
| Iterative Arrays with Finite Inter-cell Communication. | 0 | 0.34 | 2019 |
| Iterative Arrays with Self-verifying Communication Cell. | 0 | 0.34 | 2019 |
| Descriptional Complexity of Iterated Uniform Finite-State Transducers. | 0 | 0.34 | 2019 |
| Automata that may change their mind. | 0 | 0.34 | 2018 |
| DIVING INTO THE QUEUE | 0 | 0.34 | 2018 |
| Transducing Reversibly with Finite State Machines. | 0 | 0.34 | 2017 |
| On The Descriptional Complexity Of Operations On Semilinear Sets | 0 | 0.34 | 2017 |
| Descriptional Complexity of Bounded Regular Languages. | 0 | 0.34 | 2017 |
| Deterministic Stack Transducers | 2 | 0.40 | 2017 |
| Concatenation-free languages. | 0 | 0.34 | 2017 |
| The Degree Of Irreversibility In Deterministic Finite Automata | 1 | 0.37 | 2017 |
| Reversible Nondeterministic Finite Automata | 0 | 0.34 | 2017 |
| Structure and Complexity of Some Subregular Language Families. | 0 | 0.34 | 2017 |
| The Chop of Languages. | 0 | 0.34 | 2017 |
| When input-driven pushdown automata meet reversibility. | 0 | 0.34 | 2016 |
| Reversible Shrinking Two-Pushdown Automata. | 1 | 0.35 | 2016 |
| Input-Driven Queue Automata with Internal Transductions. | 0 | 0.34 | 2016 |
| Expressive Capacity of Concatenation Freeness | 0 | 0.34 | 2015 |
| Tinput-Driven Pushdown Automata | 3 | 0.41 | 2015 |
| Deterministic One-Way Turing Machines with Sublinear Space. | 1 | 0.35 | 2015 |
| Shrinking One-Way Cellular Automata | 1 | 0.37 | 2015 |
| Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. | 0 | 0.34 | 2015 |
| Returning Parallel Communicating Finite Automata With Communication Bounds: Hierarchies, Decidabilities, And Undecidabilities | 0 | 0.34 | 2015 |
| Reversible and Irreversible Computations of Deterministic Finite-State Devices | 2 | 0.50 | 2015 |
| On Simulation Cost of Unary Limited Automata | 5 | 0.47 | 2015 |
| Complexity of Operation Problems. | 0 | 0.34 | 2014 |
| Measuring Communication in Automata Systems - (Invited Paper). | 0 | 0.34 | 2014 |
| Measuring Communication In Parallel Communicating Finite Automata | 0 | 0.34 | 2014 |
| Nonterminal Controlled String Assembling Systems. | 0 | 0.34 | 2014 |
| Head and state hierarchies for unary multi-head finite automata | 0 | 0.34 | 2014 |
| Deterministic Set Automata. | 1 | 0.36 | 2014 |
| Stateless One-Way Multi-Head Finite Automata With Pebbles | 0 | 0.34 | 2014 |
| Bidirectional string assembling systems. | 0 | 0.34 | 2014 |
| Input-Driven queue automata: finite turns, decidability, and closure properties | 1 | 0.39 | 2013 |
| One-Way Multi-Head Finite Automata with Pebbles But No States. | 2 | 0.38 | 2013 |
| Time-Symmetric machines | 0 | 0.34 | 2013 |
| States and heads do count for unary multi-head finite automata | 3 | 0.39 | 2012 |
| Oblivious two-way finite automata: Decidability and complexity | 1 | 0.35 | 2012 |
| Input-Driven stack automata | 1 | 0.36 | 2012 |
| Non-Deterministic Cellular Automata And Languages | 0 | 0.34 | 2012 |
| The Size Impact of Little Iterative Array Resources. | 1 | 0.36 | 2012 |
| Nondeterministic state complexity of star-free languages | 3 | 0.45 | 2012 |
