Minimal Union-Free Decompositions of Regular Languages.
Sergey A. AfoninDenis GolomazovPublished in: LATA (2009)
Keyphrases
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- context free grammars
- decision problems
- positive data
- pac learning
- finite state machines
- equivalence queries
- pattern matching
- context free
- query language
- special case
- relational databases
- objective function
- matching algorithm
- decision makers