Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
Alberto BertoniCarlo MereghettiBeatrice PalanoPublished in: ICTCS (2003)
Keyphrases
- lower bound
- upper bound
- objective function
- pairwise
- regular expressions
- finite state automata
- regular languages
- context free
- branch and bound
- computational complexity
- cellular automata
- running times
- grammatical inference
- expressive power
- finite automata
- finite state
- databases
- search algorithm
- optimal solution
- learning algorithm