A non-ambiguous decomposition of regular languages and factorizing codes.
Marcella AnselmoPublished in: Discret. Appl. Math. (2003)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- finite state machines
- database systems
- database
- context dependent
- context free
- query language
- inductive inference
- matching algorithm
- optimal policy
- special case