Über die mit Stackautomaten berechenbaren Funktionen

DOI10.1007/BF01967652zbMath0255.02040MaRDI QIDQ5668456

H. Müller

Publication date: 1970

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137835

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Related Items (2)

Stackautomaten in Labyrinthen ⋮ On primitive recursive wordfunctions

Cites Work

• Unnamed Item
• Unnamed Item
• Turing machines with restricted memory access
• Stack automata and compiling
• A universal two-way automaton

This page was built for publication: Über die mit Stackautomaten berechenbaren Funktionen