Multi-letter reversible and quantum finite automata

Developments in Language Theory, pp. 60-71, 2007.

Cited by: 25|Bibtex|Views14|Links
EI
Keywords:
finite automatondifferent modelqfa modelnew modelnew model fasMore(7+)

Abstract:

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this lang...More

Code:

Data:

Your rating :
0

 

Tags
Comments