Efficient Algorithms for Morphisms over Omega-Regular Languages.
Lukas FleischerManfred KufleitnerPublished in: FSTTCS (2015)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- pac learning
- context free grammars
- positive data
- finite state machines
- databases
- positive and negative
- context free
- inductive inference
- pattern matching
- statistical queries
- query language
- objective function