Writing stack acceptors

DOI10.1016/S0022-0000(72)80021-7MaRDI QIDQ2554233zbMATH OpenFDO

Authors Joseph Alphonso Giuliano

Publication date 1972

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(72)80021-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3201659 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• Principal AFL
• Relations Between Time and Tape Complexities
• Relationships between nondeterministic and deterministic tape complexities
• Stack automata and compiling
• Studies in abstract families of languages
• Two-Tape Simulation of Multitape Turing Machines
• Two-way pushdown automata
• Variations on pushdown machines (Detailed Abstract)
• Writing pushdown acceptors
• Writing stack acceptors

Cited in

(5)

• Abstract families of length-preserving processors
• Classes of formal grammars
• A relation between space, return and dual return complexities
• Writing stack acceptors
• Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata

This page was built for publication: Writing stack acceptors

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