Turing machines with restricted memory access

Cited in

(36)

On the computational complexity of membrane systems
On the computational completeness of context-free parallel communicating grammar systems
Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
Real-time computations with restricted nondeterminism
(Mem)brane automata
Counter machines
Counter machines and counter languages
Scattered context grammars generate any recursively enumerable language with two nonterminals
Multi-stack-counter languages
The computational capability of chemical reaction automata
The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
The developments of the concept of machine computability from 1936 to the 1960s
The complexity of finding SUBSEQ(A)
A useful lemma for context-free programmed grammars
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS
Error detection in formal languages
On AFL generators for finitely encoded AFA
RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
On the computational complexity of P automata
Quasi-realtime languages
P Systems with String Objects and with Communication by Request
On universality of concurrent expressions with synchronization primitives
Pushdown automata with counters
Domain-free -calculus
TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS
Über die mit Stackautomaten berechenbaren Funktionen
Non-overlapping inversion on strings and languages
On information invariants in robotics
On the classes of languages characterized by generalized P colony automata
Parallel communicating grammar systems with context-free components are Turing complete for any communication model
Representing graph families with edge grammars
On the number of components and clusters of non-returning parallel communicating grammar systems
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
Some definitional suggestions for automata theory
On the pre-AFL of \([lg\;n]\) space and related families of languages

This page was built for publication: Turing machines with restricted memory access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5522203)