Regular description of context-free graph languages

DOI10.1006/jcss.1996.0087zbMath0869.68063OpenAlexW2025087469MaRDI QIDQ676459

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

zbMATH Keywords

regular tree languageregular string language

Mathematics Subject Classification ID

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

Related Items (3)

A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser for helpful comments. ⋮ Logical description of context-free graph languages ⋮ An operational and denotational approach to non-context-freeness

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