Turing machines with restricted memory access
From MaRDI portal
Publication:5522203
DOI10.1016/S0019-9958(66)80003-7zbMath0145.24205MaRDI QIDQ5522203
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Related Items
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems, P Systems with String Objects and with Communication by Request, ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS, Counter machines and counter languages, Quasi-realtime languages, Multi-stack-counter languages, Über die mit Stackautomaten berechenbaren Funktionen, RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS, Scattered context grammars generate any recursively enumerable language with two nonterminals, On the computational complexity of membrane systems, The complexity of finding SUBSEQ\((A)\), On the computational complexity of P automata, (Mem)brane automata, An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines, On universality of concurrent expressions with synchronization primitives, On the pre-AFL of \([lg\;n\) space and related families of languages], A useful lemma for context-free programmed grammars, On the computational completeness of context-free parallel communicating grammar systems, The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors, Counter machines, Representing graph families with edge grammars, Some definitional suggestions for automata theory, Error detection in formal languages, Pushdown automata with counters, On AFL generators for finitely encoded AFA, Domain-Freeλµ-Calculus, PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS, TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS, Real-time computations with restricted nondeterminism
