Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar
From MaRDI portal
Publication:4141225
DOI10.1007/BF02276800zbMath0365.02027MaRDI QIDQ4141225
Publication date: 1976
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137914
68Q25: Analysis of algorithms and problem complexity
03D05: Automata and formal grammars in connection with logical questions
03D20: Recursive functions and relations, subrecursive hierarchies
Cites Work