Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages.
Christoph BehleAndreas KrebsStephanie ReifferscheidPublished in: CAI (2011)
Keyphrases
- regular languages
- grammatical inference
- context free languages
- regular expressions
- finite automata
- decision problems
- positive data
- context free grammars
- pac learning
- context free
- statistical queries
- finite state machines
- inductive inference
- uniform distribution
- positive and negative
- data model
- learning theory
- equivalence queries
- pattern matching