A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of real-time, linear-time and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered. (orig.)Available from TIB Hannover: RO 9119(9501) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
Part 2: Regular PapersInternational audienceWe investigate cellular automata as acceptors for formal...
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated....
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
A stack augmented generalization of cellular automata, the pushdown cellular automata, are investiga...
AbstractA stack augmented generalization of cellular automata, the pushdown cellular automata, are i...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
Abstract. One-way and two-way cellular language acceptors with restricted nondeterminism are investi...
Devices of interconnected parallel acting sequential automata are investigated from a language theor...
Devices of interconnected parallel acting sequential automata are investigated from a language theor...
Abstract. We contribute to the theory of formal languages of visibly multistack pushdown automata (M...
A linear time extension of determinis-tic pushdown automata is introduced that recognizes all determ...
AbstractThe paper considers multistack pushdown automata with several strategies on the use of stack...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
Abstract. The capabilities of alternating cellular automata (ACA) to accept formal languages are inv...
Abstract. Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusi...
Part 2: Regular PapersInternational audienceWe investigate cellular automata as acceptors for formal...
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated....
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
A stack augmented generalization of cellular automata, the pushdown cellular automata, are investiga...
AbstractA stack augmented generalization of cellular automata, the pushdown cellular automata, are i...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
Abstract. One-way and two-way cellular language acceptors with restricted nondeterminism are investi...
Devices of interconnected parallel acting sequential automata are investigated from a language theor...
Devices of interconnected parallel acting sequential automata are investigated from a language theor...
Abstract. We contribute to the theory of formal languages of visibly multistack pushdown automata (M...
A linear time extension of determinis-tic pushdown automata is introduced that recognizes all determ...
AbstractThe paper considers multistack pushdown automata with several strategies on the use of stack...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
Abstract. The capabilities of alternating cellular automata (ACA) to accept formal languages are inv...
Abstract. Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusi...
Part 2: Regular PapersInternational audienceWe investigate cellular automata as acceptors for formal...
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated....
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
Add to ORKG