Co-determinism and unambiguity of automata accepting finite or infinite words.
Stefan AndreiWei-Ngan ChinGheorghe GrigorasPublished in: Sci. Ann. Cuza Univ. (2004)
Keyphrases
- finite automata
- regular languages
- finite sets
- cellular automata
- probabilistic automata
- word sense disambiguation
- finite number
- real numbers
- regular expressions
- english words
- keywords
- related words
- text documents
- finite state machines
- word recognition
- n gram
- database
- finite automaton
- grammatical inference
- knowledge base
- feature selection
- genetic algorithm
- neural network