Grammars on partial graphs

DOI10.1007/BF00288659MaRDI QIDQ1227277zbMATH OpenFDO

Authors H. J. Schneider, Hartmut Ehrig

Publication date 1976

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00288659

Mathematics Subject Classification ID

Graph theory (05C99) Categories of machines, automata (18B20) Formal languages and automata (68Q45)

Cites work

• A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets
• scientific article; zbMATH DE number 3386919 (Why is no real title available?)
• Pair grammars, graph languages and string-to-graph translations

Cited in

(8)

• Parallelism and concurrency of graph manipulations
• On the generative power of sequential and parallel programmed graph grammars
• A class of linearly parsable graph grammars
• On labelled graph grammars
• Algebraic transformation of unary partial algebras II: Single-pushout approach
• Algebraic transformation of unary partial algebras. I: Double-pushout approach
• Transformations of structures: An algebraic approach
• Parallelism and concurrency in high-level replacement systems

This page was built for publication: Grammars on partial graphs

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