Classical Automata on Promise Problems

DOI10.1007/978-3-319-09704-6_12zbMath1333.68165arXiv1405.6671OpenAlexW1481290076MaRDI QIDQ5496183

Viliam Geffert, Abuzer Yakaryılmaz

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Unary probabilistic and quantum automata on promise problems ⋮ Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ Quantum Finite Automata: A Modern Introduction ⋮ Classical and Quantum Counter Automata on Promise Problems ⋮ Unnamed Item ⋮ Promise problems solved by quantum and classical finite automata

This page was built for publication: Classical Automata on Promise Problems