Login / Signup
Typed Monoids - An Eilenberg-like Theorem for non regular Languages.
Christoph Behle
Andreas Krebs
Stephanie Reifferscheid
Published in:
Electron. Colloquium Comput. Complex. (2011)
Keyphrases
</>
regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
pac learning
positive data
context free grammars
finite state machines
context free
statistical queries
positive and negative
sample complexity
uniform distribution
xml schema
matching algorithm