The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

DOI10.23638/DMTCS-22-1-13zbMath1451.68158arXiv1904.01381OpenAlexW2928935854MaRDI QIDQ5130748

Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryılmaz

Publication date: 28 October 2020

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

zbMATH Keywords

probabilistic automatonunary languagesquantum automatonuncountable languagesrecognition with cutpoint

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Superiority of exact quantum automata for promise problems
• Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday
• Quantum automata and quantum grammars
• More on quantum, stochastic, and pseudo stochastic languages with few states
• Quantum, Stochastic, and Pseudo Stochastic Languages with Few States
• Word-functions of stochastic and pseudo stochastic automata
• Generalized Automata and Stochastic Languages

This page was built for publication: The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints