scientific article
From MaRDI portal
Publication:4044553
zbMath0293.02026MaRDI QIDQ4044553
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (10)
Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ On primitive recursive wordfunctions ⋮ A recursive and a grammatical characterization of the exponential-time languages ⋮ Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität ⋮ Axiomatizing Resource Bounds for Measure ⋮ Finite complete rewriting systems and the complexity of word problem ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ Classes of regular and context-free languages over countably infinite alphabets ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
This page was built for publication:
