Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages

Authors:
Mika Hirvensalo
Affiliations:
Department of Mathematics, University of Turku, FIN-20014 Turku, Finland and TUCS --- Turku Centre for Computer Science,
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Various Aspects of Finite Quantum Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Probabilistic automata on finite words: decidable and undecidable problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the joint spectral radius for bounded matrix languages

RP'10 Proceedings of the 4th international conference on Reachability problems
Decision Problems for Probabilistic Finite Automata on Bounded Languages

Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers

Hi-index	0.00

We give constructions of small probabilistic and MO-type quantum automata that have undecidable emptiness problem for the cut-point languages.