Login / Signup
Regularity for a Large Class of Context-Free Processes is Decidable.
D. J. B. Bosscher
W. O. David Griffioen
Published in:
ICALP (1996)
Keyphrases
</>
context free
context sensitive
context dependent
grammatical inference
context free languages
context free grammars
inductive inference
finite state
tree languages
parse tree
attribute grammars
grammar rules
graph grammars
high level
low level
regular languages