A note on semilinear sets and bounded-reversal multihead pushdown automata
From MaRDI portal
Publication:1212796
DOI10.1016/0020-0190(74)90043-XzbMath0294.68019OpenAlexW2032543301MaRDI QIDQ1212796
Publication date: 1974
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(74)90043-x
Related Items (31)
PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS ⋮ ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ Hierarchies of one-way multihead automata languages ⋮ Unnamed Item ⋮ Pushdown automata with reversal-bounded counters ⋮ Complexity of multi-head finite automata: origins and directions ⋮ On synchronized multi-tape and multi-head automata ⋮ Descriptional complexity of two-way pushdown automata with restricted head reversals ⋮ ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS ⋮ Two-way deterministic multi-weak-counter machines ⋮ On the Computational Capacity of Parallel Communicating Finite Automata ⋮ ON STATELESS AUTOMATA AND P SYSTEMS ⋮ Head and state hierarchies for unary multi-head finite automata ⋮ Multi-head Monitoring of Metric Temporal Logic ⋮ Sensing versus nonsensing automata ⋮ PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES ⋮ SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA ⋮ Investigations on Automata and Languages Over a Unary Alphabet ⋮ On partially blind multihead finite automata. ⋮ One-reversal counter machines and multihead automata: revisited ⋮ First-order logics: some characterizations and closure properties ⋮ A useful device for showing the solvability of some decision problems ⋮ Finite automata with multiplication ⋮ On the power of parallel communicating Watson-Crick automata systems ⋮ On Synchronized Multitape and Multihead Automata ⋮ Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals ⋮ One-way simple multihead finite automata ⋮ Some classes of languages in \(NC^ 1\) ⋮ Descriptional complexity of regular languages ⋮ One-way simple multihead finite automata are not closed under concatenation ⋮ A note on bounded-reversal multipushdown machines
Cites Work
This page was built for publication: A note on semilinear sets and bounded-reversal multihead pushdown automata
