Login / Signup
Finite idempotent groupoids and regular languages.
Martin Beaudry
Published in:
RAIRO Theor. Informatics Appl. (1998)
Keyphrases
</>
regular languages
finite automata
regular expressions
grammatical inference
context free languages
decision problems
context free grammars
pattern matching
positive data
pac learning
statistical queries
databases
machine learning
decision trees
finite state machines
context free