Minimal cover-automata for finite languages.
Cezar CâmpeanuNicolae SanteanSheng YuPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- database systems
- finite automata
- grammatical inference
- regular languages
- expressive power
- finite state automata
- closure properties
- cellular automata
- language independent
- formal languages
- probabilistic automata
- regular expressions
- multi lingual
- tree automata
- text summarization
- formal language theory
- finite number
- monadic datalog
- finite automaton
- formal language
- lattice gas
- language identification
- hidden markov models
- knowledge base
- target language
- finite state
- machine translation
- information extraction