Strongly Regular Grammars and Regular Approximation of Context-Free Languages.
Ömer EgeciogluPublished in: Developments in Language Theory (2009)
Keyphrases
- context free
- context free languages
- regular languages
- grammatical inference
- context free grammars
- context sensitive
- regular expressions
- context dependent
- finite state
- inductive inference
- decision problems
- language model
- finite automata
- uniform distribution
- information retrieval
- dynamic programming
- hidden markov models
- lower bound