Writing pushdown acceptors

DOI10.1016/S0022-0000(69)80017-6zbMath0198.03104MaRDI QIDQ2540271

G. Mager

Publication date: 1969

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

zbMATH Keywords

languages, automata, networks

Related Items (7)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stack automata and compiling
• An Approach to a Unified Theory of Automata
• Two-way pushdown automata
• On the elimination of endmarkers

This page was built for publication: Writing pushdown acceptors