Login / Signup
Towards Regular Languages over Infinite Alphabets.
Frank Neven
Thomas Schwentick
Victor Vianu
Published in:
MFCS (2001)
Keyphrases
</>
regular languages
grammatical inference
regular expressions
finite automata
context free languages
decision problems
context free grammars
positive data
pac learning
finite state machines
pattern matching
query language
computational complexity
optimal solution
statistical queries
knowledge base
query processing
upper bound
lower bound
inductive inference
databases