On the commutative equivalence of bounded context-free and regular languages: The code case.
Flavio D'AlessandroBenedetto IntrigilaPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- context free
- context free languages
- regular languages
- grammatical inference
- context sensitive
- context free grammars
- context dependent
- regular expressions
- inductive inference
- finite state
- finite automata
- decision problems
- parse tree
- natural language processing
- positive data
- machine learning
- database
- efficient learning
- dynamic programming
- high level