Found: 24
Select item for more details and to access through your institution.
FINITE STATE VERIFIERS WITH CONSTANT RANDOMNESS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:6)2014
- By:
- Publication type:
- Article
Exclusive affine languages.
- Published in:
- Baltic Journal of Modern Computing, 2022, v. 10, n. 3, p. 560, doi. 10.22364/bjmc.2022.10.3.26
- By:
- Publication type:
- Article
Comparing Quantum Software Development Kits for Introductory Level Education.
- Published in:
- Baltic Journal of Modern Computing, 2022, v. 10, n. 1, p. 87, doi. 10.22364/bjmc.2022.10.1.06
- By:
- Publication type:
- Article
Decision Problems on Unary Probabilistic and Quantum Automata.
- Published in:
- Baltic Journal of Modern Computing, 2016, v. 4, n. 4, p. 965, doi. 10.22364/bjmc.2016.4.4.22
- By:
- Publication type:
- Article
Exact Affine Counter Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2022, v. 33, n. 3/4, p. 349, doi. 10.1142/S012905412241009X
- By:
- Publication type:
- Article
Error-Free Affine, Unitary, and Probabilistic OBDDs.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 7, p. 827, doi. 10.1142/S0129054121500246
- By:
- Publication type:
- Article
New Results on Vector and Homing Vector Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 8, p. 1335, doi. 10.1142/S0129054119500291
- By:
- Publication type:
- Article
Uncountable Realtime Probabilistic Classes.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 8, p. 1317, doi. 10.1142/S012905411950028X
- By:
- Publication type:
- Article
On a Conjecture by Christian Choffrut.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 5, p. 483, doi. 10.1142/S0129054117400032
- By:
- Publication type:
- Article
New Results on the Minimum Amount of Useful Space.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 2, p. 259, doi. 10.1142/S0129054116400098
- By:
- Publication type:
- Article
Debates with Small Transparent Quantum Verifiers.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 2, p. 283, doi. 10.1142/S0129054116400104
- By:
- Publication type:
- Article
FINITE AUTOMATA WITH ADVICE TAPES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 8, p. 987, doi. 10.1142/S012905411440019X
- By:
- Publication type:
- Article
TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 8, p. 1243, doi. 10.1142/S0129054113500329
- By:
- Publication type:
- Article
The Complexity of Debate Checking.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 36, doi. 10.1007/s00224-014-9547-7
- By:
- Publication type:
- Article
Correction to: Computational limitations of affine automata and generalized affine automata.
- Published in:
- 2021
- By:
- Publication type:
- Correction Notice
Computational limitations of affine automata and generalized affine automata.
- Published in:
- Natural Computing, 2021, v. 20, n. 2, p. 259, doi. 10.1007/s11047-020-09815-1
- By:
- Publication type:
- Article
Language recognition power and succinctness of affine automata.
- Published in:
- Natural Computing, 2018, v. 17, n. 2, p. 283, doi. 10.1007/s11047-017-9652-z
- By:
- Publication type:
- Article
More on quantum, stochastic, and pseudo stochastic languages with few states.
- Published in:
- Natural Computing, 2016, v. 15, n. 1, p. 129, doi. 10.1007/s11047-015-9511-8
- By:
- Publication type:
- Article
Computation with multiple CTCs of fixed length and width.
- Published in:
- Natural Computing, 2012, v. 11, n. 4, p. 579, doi. 10.1007/s11047-012-9337-6
- By:
- Publication type:
- Article
Quantum computation with write-only memory.
- Published in:
- Natural Computing, 2012, v. 11, n. 1, p. 81, doi. 10.1007/s11047-011-9270-0
- By:
- Publication type:
- Article
QUANTUM COUNTER AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 5, p. 1099, doi. 10.1142/S012905411250013X
- By:
- Publication type:
- Article
Unary probabilistic and quantum automata on promise problems.
- Published in:
- Quantum Information Processing, 2018, v. 17, n. 2, p. N.PAG, doi. 10.1007/s11128-017-1799-0
- By:
- Publication type:
- Article
Uncountable classical and quantum complexity classes.
- Published in:
- RAIRO - Theoretical Informatics & Applications, 2018, v. 52, n. 2-4, p. 111, doi. 10.1051/ita/2018012
- By:
- Publication type:
- Article
Superiority of one-way and realtime quantum machines.
- Published in:
- RAIRO - Theoretical Informatics & Applications, 2012, v. 46, n. 4, p. 615, doi. 10.1051/ita/2012018
- By:
- Publication type:
- Article