Semigroups of regular languages over a one letter alphabet are rational.
Sergey A. AfoninElena KhazovaPublished in: AFL (2008)
Keyphrases
- regular languages
- finite automata
- regular expressions
- context free languages
- grammatical inference
- pattern matching
- decision problems
- context free grammars
- positive data
- pac learning
- decision making
- training data
- theoretical analysis
- utility function
- knowledge base
- finite state machines
- inductive inference
- learning algorithm
- databases