Toward a mathematical theory of graph-generative systems and its applications (Q1237578): Difference between revisions

@@ Property / author @@
+Peter Ann-Beng Ng
@@ Property / author: Peter Ann-Beng Ng / rank @@
+Normal rank
@@ Property / author @@
+Sung-Yang Bang
@@ Property / author: Sung-Yang Bang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0255(76)90021-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1969211910
@@ Property / OpenAlex ID: W1969211910 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic two-tape automata
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Toward an understanding of data structures
@@ Property / cites work: Toward an understanding of data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of computational complexity
@@ Property / cites work: Degrees of computational complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Plex languages
@@ Property / cites work: Plex languages / rank @@
+Normal rank
@@ Property / cites work @@
+Syntactic methods in pattern recognition
@@ Property / cites work: Syntactic methods in pattern recognition / rank @@
+Normal rank
@@ Property / cites work @@
+Program schemes, recursion schemes, and formal languages
+Normal rank
@@ Property / cites work @@
+On program schemata equivalence
@@ Property / cites work: On program schemata equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+The enumerability and invariance of complexity classes
+Normal rank
@@ Property / cites work @@
+Q5656399
@@ Property / cites work: Q5656399 / rank @@
+Normal rank
@@ Property / cites work @@
+Using Graph Grammars To Define Sets Of Digraphs
@@ Property / cites work: Using Graph Grammars To Define Sets Of Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Pair grammars, graph languages and string-to-graph translations
+Normal rank
@@ Property / cites work @@
+Process complexity and effective random tests
@@ Property / cites work: Process complexity and effective random tests / rank @@
+Normal rank
@@ Property / cites work @@
+Graph property recognition machines
@@ Property / cites work: Graph property recognition machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672234
@@ Property / cites work: Q5672234 / rank @@
+Normal rank
@@ Property / cites work @@
+The Equivalence Problem of Simple Programs
@@ Property / cites work: The Equivalence Problem of Simple Programs / rank @@
+Normal rank