Monoid Automata for Displacement Context-Free Languages.
Alexey SorokinPublished in: ESSLLI Student Sessions (2013)
Keyphrases
- context free languages
- regular languages
- context free
- finite automata
- regular expressions
- grammatical inference
- context free grammars
- decision problems
- context sensitive
- finite state
- context dependent
- finite state machines
- pac learning
- positive data
- inductive inference
- pattern matching
- learning algorithm
- positive and negative
- language model
- query language
- computational complexity