Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
From MaRDI portal
Publication:2536525
DOI10.1007/BF01112182zbMath0187.27701MaRDI QIDQ2536525
Publication date: 1969
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (6)
On quasi-universal word functions ⋮ Operation of bound prefix concatenation and finite superposition bases ⋮ New substitution bases for complexity classes ⋮ On the operations of bounded suffix summation and multiplication ⋮ Bounded prefix concatenation operation and finite bases with respect to the superposition ⋮ Bounded monotone recursion and multihead automata
Cites Work
This page was built for publication: Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
