Writing pushdown acceptors

DOI10.1016/S0022-0000(69)80017-6MaRDI QIDQ2540271zbMATHFDO

Authors G. Mager

Publication date 1969

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

zbMATH Keywords

languages, automata, networks

Cites work

• 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?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• An Approach to a Unified Theory of Automata
• On the elimination of endmarkers
• Stack automata and compiling
• Two-way pushdown automata

Cited in

(7)

• Abstract families of length-preserving processors
• Theory of formal grammars
• Turing machines with access to history
• Turing machines and the spectra of first-order formulas
• A recursive and a grammatical characterization of the exponential-time languages
• On the existence of generators for certain AFL
• Writing stack acceptors

This page was built for publication: Writing pushdown acceptors

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