An extrinsic characterization of addressable data graphs

DOI10.1016/0012-365X(74)90071-5zbMath0294.68014OpenAlexW2017740752MaRDI QIDQ1212795

Arnold L. Rosenberg

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90071-5

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (1)

Exposing graph uniformities via algebraic specification

Cites Work

• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Data graphs and addressing schemes
• Symmetries in Data Graphs
• Addressable Data Graphs

This page was built for publication: An extrinsic characterization of addressable data graphs