Looking for Pairs that Hard to Separate: A Quantum Approach
CIAA, pp. 213-223, 2016.
Determining the minimum number of states required by a deterministic finite automaton to separate a given pair of different words (to accept one word and to reject the other) is an important challenge. In this paper, we ask the same question for quantum finite automata (QFAs). We classify such pairs as easy and hard ones. We show that 2-s...More
Full Text (Upload PDF)
PPT (Upload PPT)