A Note on Minimal Cover-Automata for Finite Languages.
Pedro GarcíaJosé RuizPublished in: Bull. EATCS (2004)
Keyphrases
- finite automata
- rational kernels
- linear separability
- grammatical inference
- regular languages
- context free
- monadic datalog
- closure properties
- linearly separable
- probabilistic automata
- formal languages
- finite state automata
- formal language theory
- language independent
- expressive power
- spoken dialog
- multi lingual
- target language
- integer points
- cellular automata
- cross lingual
- finite number
- tree automata
- finite state
- regular expressions
- finite state machines
- learning from positive data
- recursively enumerable
- database
- finite automaton
- programming language
- relational databases
- text summarization
- neural network