Quantum, Stochastic, and Pseudo Stochastic Languages with Few States

DOI10.1007/978-3-319-08123-6_27zbMath1445.68126arXiv1405.0055OpenAlexW1676886548MaRDI QIDQ2945548

Arseny M. Shur, Abuzer Yakaryılmaz

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0055

zbMATH Keywords

quantum finite automataunary languagesprobabilistic finite automatageneralized finite automatastochastic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Related Items (4)

Quantum Finite Automata: A Modern Introduction ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Uncountable classical and quantum complexity classes ⋮ The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

This page was built for publication: Quantum, Stochastic, and Pseudo Stochastic Languages with Few States