On the decidability of certain integer subgraph problems on context-free graph languages
From MaRDI portal
Publication:1333275
DOI10.1006/inco.1994.1063zbMath0820.68067OpenAlexW1969088538MaRDI QIDQ1333275
Publication date: 13 September 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1063
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items (2)
The complexity of connectivity problems on context-free graph languages ⋮ Decidability of the finiteness of ranges of tree transductions
This page was built for publication: On the decidability of certain integer subgraph problems on context-free graph languages
