Über einen Automaten mit Pufferspeicherung

DOI10.1007/BF02234250zbMath0188.03301MaRDI QIDQ2537131

Yanyan Li

Publication date: 1970

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items (13)

Fast nondeterministic recognition of context-free languages using two queues ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Deque automata, languages, and planar graph representations ⋮ Queue Automata: Foundations and Developments ⋮ Multiple equality sets and Post machines ⋮ Most pseudo-copy languages are not context-free ⋮ QRT FIFO automata, breadth-first grammars and their relations ⋮ On the power of several queues ⋮ Two collapsing hierarchies of subregularly tree controlled languages ⋮ Diving into the queue ⋮ PROGRAMMED GRAMMARS WITH RULE QUEUES ⋮ Boosting Reversible Pushdown and Queue Machines by Preprocessing ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real time computation
• On certain formal properties of grammars
• The Syntax of Programming Languages-A Survey
• Preservation of languages by transducers
• The theory of languages
• Computability of Recursive Functions
• A variant of a recursively unsolvable problem

This page was built for publication: Über einen Automaten mit Pufferspeicherung