| Publication | Date of Publication | Type |
|---|
On properties of languages accepted by deterministic pushdown automata with translucent input letters
Theoretical Computer Science | 2026-04-16 | Paper |
Deterministic pushdown automata with translucent input letters
Information and Computation | 2026-02-02 | Paper |
| Two-way finite automata with translucent input letters | 2025-12-15 | Paper |
| Latvian quantum finite state automata for unary languages | 2025-08-19 | Paper |
Latvian quantum finite state automata for unary languages
International Journal of Foundations of Computer Science | 2025-04-30 | Paper |
Computational power of autonomous robots: transparency vs. opaqueness
Theoretical Computer Science | 2025-03-31 | Paper |
| Deterministic pushdown automata with translucent input letters | 2025-01-31 | Paper |
| On properties of languages accepted by deterministic pushdown automata with translucent input letters | 2025-01-20 | Paper |
| scientific article; zbMATH DE number 7770052 (Why is no real title available?) | 2023-11-23 | Paper |
Uniform circle formation for swarms of opaque robots with lights
Lecture Notes in Computer Science | 2023-08-02 | 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 |
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
Fundamenta Informaticae | 2022-07-14 | 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 |
The descriptional power of queue automata of constant length
Acta Informatica | 2021-07-23 | Paper |
| Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion | 2021-07-14 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Descriptional Complexity of Formal Systems | 2020-05-12 | Paper |
Online Minimum Spanning Tree with Advice
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Boolean language operations on nondeterministic automata with a pushdown of constant height
Journal of Computer and System Sciences | 2017-09-15 | Paper |
Quantum finite automata: advances on Bertoni's ideas
Theoretical Computer Science | 2017-03-16 | Paper |
Online minimum spanning tree with advice (extended abstract)
Lecture Notes in Computer Science | 2016-03-10 | Paper |
On the power of one-way automata with quantum and classical states
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Complexity of promise problems on classical and quantum automata
Computing with New Resources | 2015-09-08 | Paper |
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
Theoretical Computer Science | 2015-05-18 | Paper |
| scientific article; zbMATH DE number 6415494 (Why is no real title available?) | 2015-03-16 | Paper |
| Descriptional complexity of pushdown store languages | 2015-03-16 | Paper |
On the power of one-way automata with quantum and classical states
Implementation and Application of Automata | 2014-09-26 | Paper |
Size lower bounds for quantum automata
Theoretical Computer Science | 2014-08-29 | Paper |
Removing nondeterminism in constant height pushdown automata
Information and Computation | 2014-07-18 | Paper |
Queue automata of constant length
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
A direct construction of finite state automata for pushdown store languages
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 |
Size lower bounds for quantum automata
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Boolean language operations on nondeterministic automata with a pushdown of constant height
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Removing nondeterminism in constant height pushdown automata
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Descriptional complexity of pushdown store languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
First-order logics: some characterizations and closure properties
Acta Informatica | 2012-10-15 | Paper |
The size-cost of Boolean operations on constant height deterministic pushdown automata
Theoretical Computer Science | 2012-08-13 | Paper |
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science | 2012-08-13 | Paper |
On the size of unary probabilistic and nondeterministic automata
Fundamenta Informaticae | 2012-05-04 | Paper |
The size-cost of Boolean operations on constant height deterministic pushdown automata
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Descriptional complexity of two-way pushdown automata with restricted head reversals
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
| Quantum automata and periodic events | 2011-07-27 | Paper |
Behaviours of unary quantum automata
Fundamenta Informaticae | 2011-05-18 | Paper |
Sublinearly space bounded iterative arrays
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing | 2010-09-16 | Paper |
On the expressive power of FO[+]
Language and Automata Theory and Applications | 2010-05-26 | Paper |
More concise representation of regular languages by automata and regular expressions
Information and Computation | 2010-04-08 | Paper |
Lower bounds on the size of quantum automata accepting unary languages.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Context-Free Grammars and XML Languages
Developments in Language Theory | 2009-03-26 | Paper |
More Concise Representation of Regular Languages by Automata and Regular Expressions
Developments in Language Theory | 2008-10-30 | Paper |
A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Quantum automata for some multiperiodic languages
Theoretical Computer Science | 2007-12-19 | Paper |
The complexity of minimum difference cover
Journal of Discrete Algorithms | 2007-11-05 | Paper |
Quantum finite automata with control language
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Quantum finite automata with control language
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Quantum finite automata with control language
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Some formal tools for analyzing quantum automata.
Theoretical Computer Science | 2006-05-18 | Paper |
GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Small size quantum automata recognizing some regular languages
Theoretical Computer Science | 2005-08-01 | Paper |
| scientific article; zbMATH DE number 2044497 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2040892 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2018620 (Why is no real title available?) | 2003-12-16 | Paper |
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
RAIRO - Theoretical Informatics and Applications | 2003-05-14 | Paper |
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
RAIRO - Theoretical Informatics and Applications | 2003-05-14 | Paper |
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
RAIRO - Theoretical Informatics and Applications | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1809724 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1688372 (Why is no real title available?) | 2002-01-09 | Paper |
Threshold Circuits for Iterated Matrix Product and Powering
RAIRO - Theoretical Informatics and Applications | 2001-06-13 | Paper |
Threshold Circuits for Iterated Matrix Product and Powering
RAIRO - Theoretical Informatics and Applications | 2001-06-13 | Paper |
