A semantically meaningful characterization of reducible flowchart schemes (Q1254851): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(79)90016-1
+Normal rank
@@ Property / OpenAlex ID @@
+W4233486847
@@ Property / OpenAlex ID: W4233486847 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic and graph theoretic characterizations of structured flowchart schemes
+Normal rank
@@ Property / cites work @@
+The existence and construction of free iterative theories
+Normal rank
@@ Property / cites work @@
+A Perspective View of Discrete Automata and Their Design
+Normal rank
@@ Property / cites work @@
+On the algebraic structure of rooted trees
@@ Property / cites work: On the algebraic structure of rooted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Flow Graph Reducibility
@@ Property / cites work: Flow Graph Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Reducible Flow Graphs
@@ Property / cites work: Characterizations of Reducible Flow Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5639839
@@ Property / cites work: Q5639839 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3253173
@@ Property / cites work: Q3253173 / rank @@
+Normal rank