Structural properties of context-free sets of graphs generated by vertex replacement
From MaRDI portal
Publication:1891154
DOI10.1006/inco.1995.1020zbMath0828.68091OpenAlexW2043711611MaRDI QIDQ1891154
No author found.
Publication date: 2 January 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1020
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (15)
Monadic second-order definable graph transductions: a survey ⋮ Trees, grids, and MSO decidability: from graphs to matroids ⋮ Simple monadic theories and partition width ⋮ On spectra of sentences of monadic second order logic with counting ⋮ The bounded degree problem for eNCE graph grammars ⋮ The monadic second-order logic of graphs. X: Linear orderings ⋮ Logical description of context-free graph languages ⋮ Upper bounds to the clique width of graphs ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Fifty years of the spectrum problem: survey and new results ⋮ The definition in monadic second-order logic of modular decompositions of ordered graphs ⋮ Relational structures constructible by quantifier free definable operations ⋮ Unnamed Item ⋮ The recognizability of sets of graphs is a robust property ⋮ The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
This page was built for publication: Structural properties of context-free sets of graphs generated by vertex replacement
