State succinctness of two-way finite automata with quantum and classical states

DOI10.1016/j.tcs.2013.06.005zbMath1296.68098arXiv1202.2651WikidataQ59196655 ScholiaQ59196655MaRDI QIDQ391188

Lvzhou Li, Paulo Mateus, Shenggen Zheng, Jozef Gruska, Dao Wen Qiu

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

state complexity; quantum finite automata; computing models; state succinctness

Mathematics Subject Classification ID

68Q45: Formal languages and automata

81P68: Quantum computation