The Bounded Degree Problem for NLC Grammars is Decidable.

Dirk Janssens Grzegorz Rozenberg Emo Welzl

Published in: J. Comput. Syst. Sci. (1986)

Keyphrases

bounded degree
graph theoretic
context free grammars
grammatical inference
natural language
bounded treewidth
tree grammars
natural language processing
visual languages
first order logic
context free
databases
social networks
datalog programs
objective function