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

DOI10.1016/S0022-0000(74)80058-9MaRDI QIDQ1393121zbMATH OpenFDO

Authors Seymour Ginsburg, Gene F. Rose

Publication date 1974

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

Full work available at URL https://doi.org/10.1016/S0022-0000(74)80058-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• An Infinite Hierarchy of Context-Free Languages
• Counter machines and counter languages
• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Multi-stack-counter languages
• Multitape AFA
• One-way stack automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Turing machines with restricted memory access

Cited in

(6)

• One-way weak-stack-counter automata
• Parallel parsing on a one-way linear array of finite-state machines
• One-way simple multihead finite automata
• Further remarks on DNA overlap assembly
• Multi-stack-counter languages
• Deterministic real-time tree-walking-storage automata

This page was built for publication: The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors

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