Prefix-Free Regular Languages: Closure Properties, Difference, and Left Quotient.
Monika KrausováPublished in: MEMICS (2011)
Keyphrases
- regular languages
- context free grammars
- closure properties
- regular expressions
- tree automata
- grammatical inference
- context free
- finite automata
- expressive power
- decision problems
- xml schema
- pattern matching
- pac learning
- uniform distribution
- context dependent
- finite state machines
- learning algorithm
- integrity constraints
- special case
- lower bound
- knowledge base