Login / Signup
A complete refinement procedure for regular separability of context-free languages.
Graeme Gange
Jorge A. Navas
Peter Schachte
Harald Søndergaard
Peter J. Stuckey
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
context free languages
context free
regular languages
grammatical inference
context free grammars
context dependent
finite automata
context sensitive
regular expressions
inductive inference
database
decision problems
positive data
lower bound
np hard
pattern matching