scientific article

zbMath0769.68078MaRDI QIDQ4037335

Walter Vogler

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

triconnected componentscyclically connected graphsrecognition problem for edge replacement grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (8)

The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Uniform parsing for hyperedge replacement grammars ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ Predictive Top-Down Parsing for Hyperedge Replacement Grammars ⋮ Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement ⋮ The use of tree transducers to compute translations between graph algebras ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)

This page was built for publication: