| Publication | Date of Publication | Type |
|---|
GAPs for Shallow Implementation of Quantum Finite Automata
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Language recognition power and succinctness of affine automata
Natural Computing | 2023-11-30 | Paper |
Correction to: ``Computational limitations of affine automata and generalized affine automata
Natural Computing | 2023-09-08 | Paper |
Computational limitations of affine automata and generalized affine automata
Natural Computing | 2023-09-08 | Paper |
Exact Affine Counter Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Error-Free Affine, Unitary, and Probabilistic OBDDs
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Quantum logarithmic space and post-selection
| 2023-06-26 | Paper |
Improved constructions for succinct affine automata
| 2022-11-09 | Paper |
Affine automata verifiers
| 2022-07-06 | Paper |
Exact affine counter automata
| 2021-12-13 | Paper |
Automata and quantum computing
| 2021-11-12 | Paper |
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
| 2020-10-28 | Paper |
Error-free affine, unitary, and probabilistic OBDDs
| 2020-06-30 | Paper |
New results on classical and quantum counter automata
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2020-01-13 | Paper |
New results on vector and homing vector automata
International Journal of Foundations of Computer Science | 2019-12-19 | Paper |
Uncountable realtime probabilistic classes
International Journal of Foundations of Computer Science | 2019-12-19 | Paper |
Computational limitations of affine automata
| 2019-10-10 | Paper |
scientific article; zbMATH DE number 7104930 (Why is no real title available?)
| 2019-09-13 | Paper |
Uncountable classical and quantum complexity classes
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
More on quantum, stochastic, and pseudo stochastic languages with few states
Natural Computing | 2019-07-08 | Paper |
scientific article; zbMATH DE number 6991602 (Why is no real title available?)
| 2018-12-10 | Paper |
Unary probabilistic and quantum automata on promise problems
Quantum Information Processing | 2018-11-07 | Paper |
New size hierarchies for two way automata
Lobachevskii Journal of Mathematics | 2018-11-02 | Paper |
On a conjecture by Christian Choffrut
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
Uncountable realtime probabilistic classes
Lecture Notes in Computer Science | 2017-08-31 | Paper |
Nondeterministic unitary OBDDs
| 2017-08-22 | Paper |
Quantum alternation
Lobachevskii Journal of Mathematics | 2017-06-30 | Paper |
On the computational power of affine automata
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Looking for Pairs that Hard to Separate: A Quantum Approach
Implementation and Application of Automata | 2016-11-09 | Paper |
Language Recognition Power and Succinctness of Affine Automata
Unconventional Computation and Natural Computation | 2016-09-28 | Paper |
Affine computation and affine automaton
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Debates with small transparent quantum verifiers
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
New results on the minimum amount of useful space
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
Computation with multiple CTCs of fixed length and width
Natural Computing | 2016-03-09 | Paper |
scientific article; zbMATH DE number 6515829 (Why is no real title available?)
| 2015-12-03 | Paper |
Unary probabilistic and quantum automata on promise problems
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Classical and quantum counter automata on promise problems
Lecture Notes in Computer Science | 2015-09-23 | Paper |
Quantum, stochastic, and pseudo stochastic languages with few states
Unconventional Computation and Natural Computation | 2015-09-14 | Paper |
Quantum finite automata: a modern introduction
Computing with New Resources | 2015-09-08 | Paper |
The complexity of debate checking
Theory of Computing Systems | 2015-09-04 | Paper |
Finite automata with advice tapes
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
The minimum amount of useful space: new results and new directions
Developments in Language Theory | 2014-10-14 | Paper |
Debates with small transparent quantum verifiers
Developments in Language Theory | 2014-10-14 | Paper |
Implications of quantum automata for contextuality
Implementation and Application of Automata | 2014-09-26 | Paper |
Unary Languages Recognized by Two-Way One-Counter Automata
Implementation and Application of Automata | 2014-09-26 | Paper |
Finite state verifiers with constant randomness
Logical Methods in Computer Science | 2014-09-05 | Paper |
Classical automata on promise problems
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
Succinctness of two-way probabilistic and quantum finite automata
| 2014-05-06 | Paper |
Real-time vector automata
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Finite automata with advice tapes
Developments in Language Theory | 2013-06-28 | Paper |
One-counter verifiers for decidable languages
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Quantum alternation
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Proving the power of postselection
Fundamenta Informaticae | 2013-04-18 | Paper |
Quantum counter automata
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Superiority of one-way and realtime quantum machines
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
Quantum computation with write-only memory
Natural Computing | 2012-11-15 | Paper |
Finite state verifiers with constant randomness
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Superiority of exact quantum automata for promise problems
Information Processing Letters | 2012-05-04 | Paper |
A new family of nonstochastic languages
Information Processing Letters | 2012-01-18 | Paper |
Languages recognized by nondeterministic quantum finite automata
| 2011-10-05 | Paper |
Unbounded-error quantum computation with small space bounds
Information and Computation | 2011-07-08 | Paper |
Computation with Narrow CTCs
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Quantum computation with devices whose contents are never read
Lecture Notes in Computer Science | 2010-07-26 | Paper |
Languages Recognized with Unbounded Error by Quantum Finite Automata
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science | 2009-05-19 | Paper |
