The Complexity of Regular DNLC Graph Languages.

IJsbrand Jan Aalbersberg Joost Engelfriet Grzegorz Rozenberg

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

Keyphrases

random walk
expressive power
computational complexity
graph representation
context free
neural network
bounded treewidth
information retrieval
learning algorithm
text classification
structured data
directed graph
graph theory
space complexity
language independent
graph theoretic