On binary ⊕-NFAs and succinct descriptions of regular languages.
Lynette van ZijlPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- decision problems
- finite automata
- pac learning
- positive data
- context free grammars
- finite state machines
- high level
- inductive inference
- statistical queries
- pattern matching
- uniform distribution
- positive and negative
- model checking
- equivalence queries
- theoretical analysis