Closure properties and complexity of rational sets of regular languages.
Andreas HolzerChristian SchallhartMichael TautschnigHelmut VeithPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- regular languages
- context free grammars
- closure properties
- decision problems
- grammatical inference
- finite automata
- regular expressions
- expressive power
- context free
- computational complexity
- tree automata
- databases
- inductive inference
- markov decision processes
- pattern matching
- dynamic programming
- pac learning
- np hard
- knowledge base
- machine learning