Quantum finite automata and linear context-free languages: a decidable problem

A. Bertoni, Ch. Choffrut, F. D'Alessandro

We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a li…