Regular description of context-free graph languages

DOI10.1006/JCSS.1996.0087zbMATH Open0869.68063OpenAlexW2025087469MaRDI QIDQ676459FDOQ676459

Authors: Vincent van Oostrom, Joost Engelfriet 

Publication date: 18 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b1fb7c6241d56844980aabe6fd32cace2d9e2e4a

Recommendations

• Logical description of context-free graph languages
• scientific article; zbMATH DE number 17539
• scientific article; zbMATH DE number 177441

zbMATH Keywords

regular string languageregular tree language

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cited In (10)

• An operational and denotational approach to non-context-freeness
• Concatenation of graphs
• Title not available (Why is that?)
• Deterministic graph grammars
• (Re)introducing regular graph languages
• Logical description of context-free graph languages
• A model theoretic description of tree adjoining grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Regular description of context-free graph languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676459)