Login / Signup
On the expressiveness of spider diagrams and commutative star-free regular languages.
Aidan J. Delaney
Gem Stapleton
John Taylor
Simon J. Thompson
Published in:
J. Vis. Lang. Comput. (2013)
Keyphrases
</>
regular languages
grammatical inference
context free languages
regular expressions
finite automata
decision problems
context free grammars
positive data
pattern matching
pac learning
software engineering
supervised learning
positive and negative
databases
context free
hidden markov models
decision trees