Login / Signup
A decidable class of (nominal) omega-regular languages over an infinite alphabet.
Vincenzo Ciancia
Matteo Sammartino
Published in:
CoRR (2013)
Keyphrases
</>
regular languages
finite automata
regular expressions
grammatical inference
context free languages
decision problems
positive data
pattern matching
pac learning
context free grammars
context free
equivalence queries
inductive inference
statistical queries
finite state machines
decision trees
theoretical analysis