scientific article
From MaRDI portal
Publication:3885190
zbMath0442.68039MaRDI QIDQ3885190
Publication date: 1980
Full work available at URL: https://eudml.org/doc/92118
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
hierarchy of languagesregister machinescounter automataone-letter alphabettwo-way multihead automata
Related Items (29)
The equivalence of pebbles and sensing heads for finite automata ⋮ On stateless multihead automata: hierarchies and the emptiness problem ⋮ Finite automata and unary languages ⋮ Hierarchies of one-way multihead automata languages ⋮ Cyclic automata ⋮ Automata with Modulo Counters and Nondeterministic Counter Bounds ⋮ k\(+1\) heads are better than k for PDAs ⋮ Alternating multihead finite automata ⋮ Tradeoffs for language recognition on alternating machines ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Complexity of multi-head finite automata: origins and directions ⋮ Generalizations of Checking Stack Automata: Characterizations and Hierarchies ⋮ Tight hierarchy of data-independent multi-head automata ⋮ Independent finite automata on Cayley graphs ⋮ Multihead two-way probabilistic finite automata ⋮ On membrane hierarchy in P systems ⋮ New results concerning synchronized finite automata ⋮ On Bounded Symport/Antiport P Systems ⋮ Multihead two-way probabilistic finite automata ⋮ Synchronized finite automata and 2DFA reductions ⋮ Diving into the queue ⋮ On the power of two-way multihead quantum finite automata ⋮ On Stateless Multihead Finite Automata and Multihead Pushdown Automata ⋮ Simulations by Time-Bounded Counter Machines ⋮ Constant-space, constant-randomness verifiers with arbitrarily small error ⋮ Remarks on multihead pushdown automata and multihead stack automata ⋮ Unnamed Item ⋮ Amplification of slight probabilistic advantage at absolutely no cost in space ⋮ Multi-head finite automata: Data-independent versus data-dependent computations
Cites Work
This page was built for publication:
