Writing stack acceptors

DOI10.1016/S0022-0000(72)80021-7zbMath0242.68023MaRDI QIDQ2554233

Joseph Alphonso Giuliano

Publication date: 1972

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

Mathematics Subject Classification ID

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

Related Items (max. 100)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relationships between nondeterministic and deterministic tape complexities
• Principal AFL
• Writing pushdown acceptors
• Writing stack acceptors
• On the Computational Complexity of Algorithms
• Variations on pushdown machines (Detailed Abstract)
• Two-Tape Simulation of Multitape Turing Machines
• Stack automata and compiling
• Two-way pushdown automata
• Relations Between Time and Tape Complexities
• Studies in abstract families of languages

This page was built for publication: Writing stack acceptors