Multi-stack-counter languages

DOI10.1007/BF01706072zbMath0229.68030OpenAlexW1975384830MaRDI QIDQ5637896

Seymour Ginsburg, Ronald V. Book

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)

Related Items

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

Cites Work

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