Writing pushdown acceptors

DOI10.1016/S0022-0000(69)80017-6zbMATH Open0198.03104MaRDI QIDQ2540271FDOQ2540271

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

• Two-way pushdown automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stack automata and compiling
• An Approach to a Unified Theory of Automata
• Title not available (Why is that?)
• On the elimination of endmarkers

Cited In (7)

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

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)