Multi-stack-counter languages

DOI10.1007/BF01706072MaRDI QIDQ5637896zbMATH OpenOpenAlexFDO

Authors Ronald V. Book, Seymour Ginsburg

Publication date 1972

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01706072

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Counter machines and counter languages
• Intercalation theorems for stack languages
• On the Computational Complexity of Algorithms
• On the closure of AFL under reversal
• One-way stack automata
• Principal AFL
• Quasi-realtime languages
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Scattered context grammars
• Studies in abstract families of languages
• The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
• Turing machines with restricted memory access

Cited in

(10)

• Classes of formal grammars
• The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
• Deterministic real-time tree-walking-storage automata
• C-graph automatic groups.
• One-way weak-stack-counter automata
• A note on realtime one-way synchronized alternating one-counter automata
• A note on real-time one-way alternating multicounter machines
• Two-way deterministic multi-weak-counter machines
• Cayley polynomial-time computable groups
• Proving containment of bounded AFL

This page was built for publication: Multi-stack-counter languages

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