Login / Signup
The Bounded Tree-Width Problem of Context-Free Graph Languages.
Konstantin Skodinis
Published in:
WG (1997)
Keyphrases
</>
context free
tree width
grammatical inference
context dependent
context sensitive
context free grammars
finite state
tree decomposition
inductive inference
structural properties
parse tree
structured data
high level
graph theory
finite automata
model checking
graphical models