| 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
RAIRO - Theoretical Informatics and Applications | 2024-04-16 | Paper |
Reversible Two-Party Computations
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
Theoretical Computer Science | 2024-04-04 | Paper |
Iterative arrays with finite inter-cell communication
Natural Computing | 2024-02-16 | Paper |
Hierarchies and undecidability results for iterative arrays with sparse communication
Natural Computing | 2024-02-09 | Paper |
Shrinking one-way cellular automata
Natural Computing | 2024-02-09 | Paper |
Reversible computations of one-way counter automata
| 2024-02-06 | Paper |
scientific article; zbMATH DE number 7770052 (Why is no real title available?)
| 2023-11-23 | Paper |
One-dimensional pattern generation by cellular automata
Natural Computing | 2023-09-01 | 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 |
Iterated uniform finite-state transducers on unary languages
Theoretical Computer Science | 2023-08-01 | Paper |
Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
| 2022-12-16 | Paper |
scientific article; zbMATH DE number 7584596 (Why is no real title available?)
| 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*
Fundamenta Informaticae | 2022-07-14 | Paper |
Finite automata with undirected state graphs
Acta Informatica | 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
Information and Computation | 2022-03-14 | Paper |
Digging input-driven pushdown automata
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
Input-driven double-head pushdown automata
| 2021-12-13 | Paper |
Reversible pushdown transducers
Information and Computation | 2021-11-25 | Paper |
Decidability questions for insertion systems and related models
Fundamenta Informaticae | 2021-11-15 | Paper |
String generation by cellular automata
Complex Systems | 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 |
Measuring communication in parallel communicating finite automata
| 2021-06-22 | Paper |
Input-driven multi-counter automata
Theoretical Computer Science | 2021-06-03 | Paper |
Transductions computed by one-dimensional cellular automata
| 2021-04-27 | Paper |
Boosting reversible pushdown and queue machines by preprocessing
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Remembering Chandra Kintala
| 2021-02-24 | Paper |
Bounded languages meet cellular automata with sparse communication
| 2021-01-26 | Paper |
Multi-head finite automata: characterizations, concepts and open problems
| 2021-01-20 | Paper |
Finite automata with undirected state graphs
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
Queue Automata: Foundations and Developments
Reversibility and Universality | 2020-05-28 | Paper |
Cellular automata: descriptional complexity and decidability
Reversibility and Universality | 2020-05-28 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Descriptional Complexity of Formal Systems | 2020-05-12 | Paper |
Input-driven multi-counter automata
Implementation and Application of Automata | 2020-05-06 | Paper |
Iterative arrays with set storage
| 2020-03-12 | Paper |
Iterative arrays with finite inter-cell communication
| 2019-12-05 | Paper |
Transducing reversibly with finite state machines
Theoretical Computer Science | 2019-08-20 | Paper |
Diving into the queue
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Reversible pushdown transducers
Developments in Language Theory | 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 |
Descriptional complexity of bounded regular languages
| 2018-03-29 | Paper |
Fast one-way cellular automata with reversible Mealy cells
| 2018-03-08 | Paper |
Tinput-driven pushdown, counter, and stack automata
Fundamenta Informaticae | 2018-01-19 | 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 |
One-way reversible multi-head finite automata
Theoretical Computer Science | 2017-06-15 | Paper |
When input-driven pushdown automata meet reversiblity
RAIRO - Theoretical Informatics and Applications | 2017-03-24 | Paper |
Descriptional complexity of bounded regular languages
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
A hierarchy of fast reversible Turing machines
Reversible Computation | 2016-09-30 | Paper |
One-way cellular automata, bounded languages, and minimal communication
Journal of Automata, Languages and Combinatorics | 2016-09-29 | 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 |
On one-way one-bit \(O\) (one)-message cellular automata
Electronic Notes in Theoretical Computer Science | 2016-06-09 | Paper |
Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Reversible shrinking two-pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Input-Driven Queue Automata with Internal Transductions
Language and Automata Theory and Applications | 2016-04-13 | Paper |
One-way reversible multi-head finite automata
Reversible Computation | 2015-11-30 | Paper |
The size of one-way cellular automata
| 2015-11-02 | Paper |
Tinput-Driven Pushdown Automata
Lecture Notes in Computer Science | 2015-09-15 | 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 |
Descriptional complexity of pushdown store languages
| 2015-03-16 | Paper |
Simulations of unary one-way multi-head finite automata
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Head and state hierarchies for unary multi-head finite automata
Acta Informatica | 2014-12-03 | Paper |
Measuring communication in automata systems (invited paper)
Developments in Language Theory | 2014-10-14 | Paper |
Deterministic set automata
Developments in Language Theory | 2014-10-14 | Paper |
Regularity and size of set automata
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Oblivious two-way finite automata: decidability and complexity
Information and Computation | 2014-07-18 | Paper |
One-dimensional cellular automaton transducers
| 2014-02-11 | Paper |
The size impact of little iterative array resources
| 2014-02-05 | Paper |
Descriptional complexity of bounded context-free languages
Information and Computation | 2013-12-04 | Paper |
A direct construction of finite state automata for pushdown store languages
Descriptional Complexity of Formal Systems | 2013-08-09 | 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 |
Reversible pushdown automata
Journal of Computer and System Sciences | 2012-11-06 | Paper |
Descriptional complexity of pushdown store languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
States and heads do count for unary multi-head finite automata
Developments in Language Theory | 2012-11-02 | Paper |
First-order logics: some characterizations and closure properties
Acta Informatica | 2012-10-15 | Paper |
Input-driven stack automata
Lecture Notes in Computer Science | 2012-09-21 | Paper |
In memoriam Chandra Kintala
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
On the computational capacity of parallel communicating finite automata
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Undecidability and hierarchy results for parallel communicating finite automata
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science | 2012-08-13 | Paper |
Oblivious two-way finite automata: decidability and complexity
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Descriptional complexity of two-way pushdown automata with restricted head reversals
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science | 2011-07-18 | Paper |
Two-party Watson-Crick computations
Implementation and Application of Automata | 2011-02-11 | Paper |
Complexity of multi-head finite automata: origins and directions
Theoretical Computer Science | 2011-01-10 | Paper |
Sublinearly space bounded iterative arrays
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
Cellular automata with sparse communication
Theoretical Computer Science | 2010-10-07 | Paper |
Computations and decidability of iterative arrays with restricted communication
Parallel Processing Letters | 2010-09-29 | Paper |
Undecidability and hierarchy results for parallel communicating finite automata
Developments in Language Theory | 2010-08-31 | Paper |
Reversible pushdown automata
Language and Automata Theory and Applications | 2010-05-26 | Paper |
On the expressive power of FO[+]
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Real-time reversible iterative arrays
Theoretical Computer Science | 2010-02-09 | Paper |
When Church-Rosser becomes context free
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Regulated nondeterminism in pushdown automata
Theoretical Computer Science | 2009-09-14 | Paper |
Cellular Automata with Sparse Communication
Implementation and Application of Automata | 2009-07-09 | Paper |
Context-Dependent Nondeterminism for Pushdown Automata
Developments in Language Theory | 2009-03-26 | Paper |
On the Computational Capacity of Parallel Communicating Finite Automata
Developments in Language Theory | 2008-10-30 | Paper |
Fast reversible language recognition using cellular automata
Information and Computation | 2008-10-08 | Paper |
DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
On recursive and non-recursive trade-offs between finite-turn pushdown automata
| 2008-08-12 | Paper |
The Boolean closure of linear context-free languages
Acta Informatica | 2008-06-17 | Paper |
Regulated Nondeterminism in Pushdown Automata
Implementation and Application of Automata | 2008-06-10 | Paper |
Real-Time Reversible Iterative Arrays
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Descriptional Complexity of Bounded Context-Free Languages
Developments in Language Theory | 2007-11-28 | Paper |
Descriptional complexity of machines with limited resources
| 2007-10-17 | Paper |
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics | 2007-09-21 | Paper |
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science | 2007-05-11 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
On two-way communication in cellular automata with a fixed number of cells
Theoretical Computer Science | 2005-02-22 | Paper |
Minimizing finite automata is computationally hard
Theoretical Computer Science | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2113947 (Why is no real title available?)
| 2004-11-05 | Paper |
scientific article; zbMATH DE number 2068878 (Why is no real title available?)
| 2004-05-27 | Paper |
scientific article; zbMATH DE number 2040922 (Why is no real title available?)
| 2004-02-11 | Paper |
