On the State Complexity of Semi-quantum Finite Automata

DOI10.1007/978-3-319-04921-2_49zbMath1407.68269arXiv1307.2499OpenAlexW1486029244MaRDI QIDQ5404947

Shenggen Zheng, Jozef Gruska, Dao Wen Qiu

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (5)

Unary probabilistic and quantum automata on promise problems ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Quantum Finite Automata: A Modern Introduction ⋮ From Quantum Query Complexity to State Complexity ⋮ Size lower bounds for quantum automata

This page was built for publication: On the State Complexity of Semi-quantum Finite Automata