Tree automata, tree decomposition and hyperedge replacement

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 22 Nov 2005 English Publisher:Springer Science and Business Media LLC

Authors: Clemens Lautemann;

doi: 10.1007/bfb0017410

Tree automata, tree decomposition and hyperedge replacement

- Summary
- Metrics

Abstract

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

Related Organizations

Johannes Gutenberg University of Mainz
Germany

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average