Succinct description of regular languages by weak restarting automata.
Martin KutribJens ReimannPublished in: Inf. Comput. (2008)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- context free grammars
- pac learning
- context free
- positive data
- finite state machines
- finite state automata
- pattern matching
- decision trees
- positive and negative
- learning algorithm
- semi supervised
- np hard
- statistical queries
- hidden markov models