Toward a mathematical theory of graph-generative systems and its applications

DOI10.1016/0020-0255(76)90021-9zbMath0356.68083OpenAlexW1969211910MaRDI QIDQ1237578

Peter Ann-Beng Ng, Sung-Yang Bang

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(76)90021-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• Syntactic methods in pattern recognition
• Program schemes, recursion schemes, and formal languages
• A hierarchy for nondeterministic time complexity
• Process complexity and effective random tests
• The enumerability and invariance of complexity classes
• Plex languages
• Pair grammars, graph languages and string-to-graph translations
• Degrees of computational complexity
• On program schemata equivalence
• Using Graph Grammars To Define Sets Of Digraphs
• The Equivalence Problem of Simple Programs
• Graph property recognition machines
• Toward an understanding of data structures

This page was built for publication: Toward a mathematical theory of graph-generative systems and its applications