Halting Stack Automata

From MaRDI portal

Revision as of 04:03, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5619051

Jump to:navigation, search

DOI10.1145/321541.321544zbMath0215.60605OpenAlexW2095246374MaRDI QIDQ5619051

Jeffrey D. Ullman

Publication date: 1969

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321541.321544

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Jede mit Stackautomaten berechenbare Funktion ist elementar ⋮ Two-way nested stack automata are equivalent to two-way stack automata ⋮ 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: Halting Stack Automata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5619051&oldid=30280818"