Compact Normal Form for Regular Languages as Xor Automata.
Jean VuilleminNicolas GamaPublished in: CIAA (2009)
Keyphrases
- normal form
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- database design
- relational databases
- positive data
- context free grammars
- relational algebra
- functional dependencies
- finite state machines
- pattern matching
- pac learning
- context free
- databases
- query language
- equivalence queries
- computational complexity