| Publication | Date of Publication | Type |
|---|
On properties of languages accepted by deterministic pushdown automata with translucent input letters
| 2025-01-20 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
Theoretical Computer Science | 2024-04-04 | Paper |
Shrinking one-way cellular automata
Natural Computing | 2024-02-09 | Paper |
Complexity of exclusive nondeterministic finite automata
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Input-Driven Double-Head Pushdown Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
State complexity of finite partial languages
Theoretical Computer Science | 2023-06-21 | Paper |
State complexity of finite partial languages
| 2023-01-18 | Paper |
State complexity of partial word finite automata
| 2022-11-09 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
| 2022-08-16 | Paper |
String assembling systems: comparison to sticker systems and decidability
| 2022-07-06 | Paper |
Input-driven double-head pushdown automata
| 2021-12-13 | Paper |
Self-verifying pushdown and queue automata
Fundamenta Informaticae | 2021-11-15 | Paper |
Reversibility for stateless ordered RRWW-automata
Acta Informatica | 2021-07-23 | Paper |
Input-driven multi-counter automata
Theoretical Computer Science | 2021-06-03 | Paper |
Boosting reversible pushdown and queue machines by preprocessing
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Multi-stranded string assembling systems
| 2020-10-22 | Paper |
Queue Automata: Foundations and Developments
Reversibility and Universality | 2020-05-28 | Paper |
Input-driven multi-counter automata
Implementation and Application of Automata | 2020-05-06 | Paper |
Transducing reversibly with finite state machines
Theoretical Computer Science | 2019-08-20 | Paper |
Expressive capacity of subregular expressions
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Diving into the queue
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Parametrizing string assembling systems
| 2018-11-07 | Paper |
Boosting pushdown and queue machines by preprocessing
| 2018-11-07 | Paper |
Descriptional complexity of bounded regular languages
| 2018-03-29 | Paper |
Descriptional complexity of limited automata
Information and Computation | 2018-03-21 | Paper |
Fast one-way cellular automata with reversible Mealy cells
| 2018-03-08 | Paper |
Reversible limited automata
Fundamenta Informaticae | 2018-01-19 | Paper |
Tinput-driven pushdown, counter, and stack automata
Fundamenta Informaticae | 2018-01-19 | Paper |
On the Computational Complexity of Partial Word Automata Problems
Fundamenta Informaticae | 2017-11-09 | Paper |
Reversible queue automata
Fundamenta Informaticae | 2017-11-09 | Paper |
Transducing reversibly with finite state machines
Implementation and Application of Automata | 2017-08-22 | Paper |
Concatenation-free languages
Theoretical Computer Science | 2017-06-19 | Paper |
When input-driven pushdown automata meet reversiblity
RAIRO - Theoretical Informatics and Applications | 2017-03-24 | Paper |
scientific article; zbMATH DE number 6665209 (Why is no real title available?)
| 2016-12-16 | Paper |
Descriptional complexity of bounded regular languages
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Reversible Ordered Restarting Automata
Reversible Computation | 2016-09-30 | Paper |
Boosting reversible pushdown machines by preprocessing
Reversible Computation | 2016-08-10 | Paper |
Set automata
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
Deterministic one-way Turing machines with sublinear space
Fundamenta Informaticae | 2016-05-11 | Paper |
Input-Driven Queue Automata with Internal Transductions
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Expressive capacity of concatenation freeness
Implementation and Application of Automata | 2015-09-23 | Paper |
Reversible limited automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Tinput-Driven Pushdown Automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On simulation cost of unary limited automata
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Shrinking One-Way Cellular Automata
Cellular Automata and Discrete Complex Systems | 2015-08-07 | Paper |
Real-time reversible one-way cellular automata
Cellular Automata and Discrete Complex Systems | 2015-08-04 | Paper |
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
Theoretical Computer Science | 2015-05-18 | Paper |
Stateless one-way multi-head finite automata with pebbles
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Simulations of unary one-way multi-head finite automata
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Parameterized Prefix Distance between Regular Languages
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Head and state hierarchies for unary multi-head finite automata
Acta Informatica | 2014-12-03 | Paper |
Deterministic set automata
Developments in Language Theory | 2014-10-14 | Paper |
Bidirectional string assembling systems
RAIRO. Theoretical Informatics and Applications | 2014-08-22 | Paper |
Regularity and size of set automata
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Size of unary one-way multi-head finite automata
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Input-driven queue automata: finite turns, decidability, and closure properties
Implementation and Application of Automata | 2013-08-07 | Paper |
One-Way Multi-Head Finite Automata with Pebbles But No States
Developments in Language Theory | 2013-06-28 | Paper |
String assembling systems
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
States and heads do count for unary multi-head finite automata
Developments in Language Theory | 2012-11-02 | Paper |
