PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983): Difference between revisions

@@ Property / cites work @@
+Multiprocessor automata
@@ Property / cites work: Multiprocessor automata / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Stack cooperation in multistack pushdown automata
@@ Property / cites work: Stack cooperation in multistack pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+On non-determinacy in simple computing devices
@@ Property / cites work: On non-determinacy in simple computing devices / rank @@
+Normal rank
@@ Property / cites work @@
+On two-way multihead automata
@@ Property / cites work: On two-way multihead automata / rank @@
+Normal rank
@@ Property / cites work @@
+A note on semilinear sets and bounded-reversal multihead pushdown automata
+Normal rank
@@ Property / cites work @@
+Shuffle on trajectories: Syntactic constraints
@@ Property / cites work: Shuffle on trajectories: Syntactic constraints / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>             + 1 Heads Are Better than             <i>k</i>
@@ Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank @@
+Normal rank