Grammars on partial graphs

DOI10.1007/BF00288659zbMath0329.68061MaRDI QIDQ1227277

Hartmut Ehrig, H. J. Schneider

Publication date: 1976

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (8)

Parallelism and concurrency in high-level replacement systems ⋮ Algebraic transformation of unary partial algebras. I: Double-pushout approach ⋮ 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 ⋮ Transformations of structures: An algebraic approach

Cites Work

• Unnamed Item
• Pair grammars, graph languages and string-to-graph translations
• A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets

This page was built for publication: Grammars on partial graphs