Succinct Description of Regular Languages by Weak Restarting Automata.
Martin KutribJens ReimannPublished in: LATA (2007)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- pac learning
- context free grammars
- finite state automata
- pattern matching
- positive data
- finite state machines
- high level
- databases
- context free
- utility function
- query language
- inductive inference
- reinforcement learning
- database