Efficient Algorithms for Morphisms over Omega-Regular Languages.
Lukas FleischerManfred KufleitnerPublished in: CoRR (2015)
Keyphrases
- regular languages
- grammatical inference
- context free languages
- regular expressions
- finite automata
- decision problems
- positive data
- context free grammars
- pac learning
- finite state machines
- context free
- pattern matching
- positive and negative
- statistical queries
- inductive inference
- dynamic programming
- database
- pattern languages
- uniform distribution
- equivalence queries
- theoretical analysis