Regularity of non context-free languages over a singleton terminal alphabet.

Alberto Pettorossi Maurizio Proietti

Published in: CoRR (2017)

Keyphrases

context free languages
regular languages
finite automata
context free
grammatical inference
context free grammars
pattern matching
regular expressions
inductive inference
context sensitive
positive data
learning algorithm
decision problems
upper bound
np hard
data model
database systems