More on quantum, stochastic, and pseudo stochastic languages with few states

DOI10.1007/S11047-015-9511-8zbMATH Open1415.68139OpenAlexW1205221740MaRDI QIDQ2003453FDOQ2003453

Arseny M. Shur, Abuzer Yakaryılmaz

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9511-8

Recommendations

• Quantum, stochastic, and pseudo stochastic languages with few states
• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
• Analogies and differences between quantum and stochastic automata
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• On the size of unary probabilistic and nondeterministic automata

zbMATH Keywords

context-free languagesquantum finite automataregular languagesunary languagesprobabilistic finite automatageneralized finite automatastochastic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unbounded-error quantum computation with small space bounds
• Probabilistic automata
• Title not available (Why is that?)
• On Context-Free Languages
• Title not available (Why is that?)
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Quantum automata and quantum grammars
• Characterizations of 1-Way Quantum Finite Automata
• Title not available (Why is that?)
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• Generalized Automata and Stochastic Languages
• Analogies and differences between quantum and stochastic automata
• Quantum Finite Automata: A Modern Introduction
• On stochastic languages
• Word-functions of stochastic and pseudo stochastic automata
• Quantum, Stochastic, and Pseudo Stochastic Languages with Few States
• Title not available (Why is that?)

Cited In (5)

• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
• Uncountable classical and quantum complexity classes
• Unary probabilistic and quantum automata on promise problems
• Language recognition power and succinctness of affine automata
• Uncountable realtime probabilistic classes

This page was built for publication: More on quantum, stochastic, and pseudo stochastic languages with few states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003453)