Pullback Grammars Are Context-Free

DOI10.1007/978-3-540-87405-8_25zbMath1175.68213OpenAlexW1857555673MaRDI QIDQ3540411

Rui Chen, Olivier Ly, Michel Bauderon

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_25

zbMATH Keywords

graph grammarpullback

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Handbook of Graph Grammars and Computing by Graph Transformation
• Pullback rewriting and applications
• Node rewriting in graphs and hypergraphs: A categorical framework

This page was built for publication: Pullback Grammars Are Context-Free