Skip to main content
Conference Proceedings

Tree automata, tree decomposition and hyperedge replacement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 532 LNCS 520-537
DOI: 10.1007/BFb0017410
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent results concerning efficient solvability of graph problems on graphs with bounded treewidth and decidability of graph properties for hyperedge-replacement graph grammars axe systematised by showing how they can he derived from recognisability of corresponding tree classes by finite tree automata, using only well-known techniques from tree-automata theory.

Author supplied keywords

Cite

CITATION STYLE

APA

Lautemann, C. (1991). Tree automata, tree decomposition and hyperedge replacement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 520–537). Springer Verlag. https://doi.org/10.1007/BFb0017410

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free