On the Density of Regular and Context-Free Languages.
Michael HartwigPublished in: Discret. Math. Algorithms Appl. (2010)
Keyphrases
- context free languages
- context free
- regular languages
- grammatical inference
- regular expressions
- context sensitive
- context dependent
- context free grammars
- finite automata
- decision problems
- inductive inference
- finite state
- pac learning
- positive data
- finite state machines
- parse tree
- pattern matching
- machine learning
- uniform distribution
- knowledge based systems
- dynamic programming
- low level