Equations Defining the Polynomial Closure of a Lattice of Regular Languages.
Mário J. J. BrancoJean-Eric PinPublished in: ICALP (2) (2009)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- equivalence queries
- finite automata
- statistical queries
- decision problems
- context free grammars
- pac learning
- membership queries
- positive data
- lattice structure
- finite state machines
- context free
- database
- efficient learning
- pattern matching
- theoretical analysis
- lower bound
- uniform distribution
- integrity constraints
- query language
- query processing