Some definitional suggestions for automata theory (Q2529464): Difference between revisions

@@ Property / cites work @@
+Q5732927
@@ Property / cites work: Q5732927 / rank @@
+Normal rank
@@ Property / cites work @@
+On Ianov's Program Schemata
@@ Property / cites work: On Ianov's Program Schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5593685
@@ Property / cites work: Q5593685 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Program an Infinite Abacus
@@ Property / cites work: How to Program an Infinite Abacus / rank @@
+Normal rank
@@ Property / cites work @@
+Computability of Recursive Functions
@@ Property / cites work: Computability of Recursive Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines with restricted memory access
@@ Property / cites work: Turing machines with restricted memory access / rank @@
+Normal rank
@@ Property / cites work @@
+Monogenic normal systems are universal
@@ Property / cites work: Monogenic normal systems are universal / rank @@
+Normal rank
@@ Property / cites work @@
+Stack automata and compiling
@@ Property / cites work: Stack automata and compiling / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences in context free languages
@@ Property / cites work: Sequences in context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583856
@@ Property / cites work: Q5583856 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of a recursively unsolvable problem
@@ Property / cites work: A variant of a recursively unsolvable problem / rank @@
+Normal rank