Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata.
Viliam GeffertGiovanni PighizziniPublished in: Algorithmica (2012)
Keyphrases
- pairwise
- finite automata
- finite state
- grammatical inference
- finite state automata
- finite automaton
- regular languages
- context free
- probabilistic automata
- expressive power
- formal languages
- tree automata
- deterministic automata
- cellular automata
- regular expressions
- markov chain
- formal language theory
- text summarization
- language independent
- context free grammars
- language identification
- turing machine
- regular path queries
- information extraction
- genetic algorithm
- multi lingual
- hidden markov models
- regular tree languages
- data model