One-way weak-stack-counter automata

DOI10.1016/0022-0000(80)90005-7zbMath0429.68069OpenAlexW1990045734MaRDI QIDQ1137874

Satoru Miyano

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90005-7

zbMATH Keywords

data structurescounter languagesintercalation theoremstack-counter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Remarks on blind and partially blind one-way multicounter machines
• The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
• Intercalation theorems for stack languages
• Deterministic context free languages
• Counter machines and counter languages
• One-way stack automata
• Multi-stack-counter languages

This page was built for publication: One-way weak-stack-counter automata