Turing machines with restricted memory access
From MaRDI portal
Publication:5522203
DOI10.1016/S0019-9958(66)80003-7zbMath0145.24205OpenAlexW2049848227MaRDI QIDQ5522203
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(66)80003-7
Related Items
Counter machines and counter languages ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines ⋮ Quasi-realtime languages ⋮ On the computational complexity of membrane systems ⋮ On the computational complexity of P automata ⋮ On the classes of languages characterized by generalized P colony automata ⋮ Multi-stack-counter languages ⋮ The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors ⋮ Scattered context grammars generate any recursively enumerable language with two nonterminals ⋮ Über die mit Stackautomaten berechenbaren Funktionen ⋮ On universality of concurrent expressions with synchronization primitives ⋮ TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS ⋮ Domain-Freeλµ-Calculus ⋮ RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS ⋮ Non-overlapping inversion on strings and languages ⋮ On information invariants in robotics ⋮ Parallel communicating grammar systems with context-free components are Turing complete for any communication model ⋮ (Mem)brane automata ⋮ On the pre-AFL of \([lg\;n\) space and related families of languages] ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems ⋮ P Systems with String Objects and with Communication by Request ⋮ Representing graph families with edge grammars ⋮ PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS ⋮ A useful lemma for context-free programmed grammars ⋮ ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS ⋮ Some definitional suggestions for automata theory ⋮ The computational capability of chemical reaction automata ⋮ Real-time computations with restricted nondeterminism ⋮ Error detection in formal languages ⋮ Pushdown automata with counters ⋮ On AFL generators for finitely encoded AFA ⋮ On the computational completeness of context-free parallel communicating grammar systems ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Counter machines
