The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors

DOI10.1016/S0022-0000(74)80058-9zbMath0275.68017MaRDI QIDQ1393121

Gene F. Rose, Seymour Ginsburg

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Multi-stack-counter languages, One-way weak-stack-counter automata, Parallel parsing on a one-way linear array of finite-state machines, Further remarks on DNA overlap assembly, One-way simple multihead finite automata

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Turing machines with restricted memory access
• Counter machines and counter languages
• One-way stack automata
• An Infinite Hierarchy of Context-Free Languages
• Multi-stack-counter languages
• Multitape AFA
• Unnamed Item
• Unnamed Item
• Unnamed Item