scientific article; zbMATH DE number 3458598

MaRDI QIDQ4044553zbMATH OpenFDO

Authors Klaus Weihrauch

Publication date 1974

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)

Cited in

(10)

• Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
• Classes of regular and context-free languages over countably infinite alphabets
• About the descriptive power of certain classes of finite string-rewriting systems
• On primitive recursive wordfunctions
• Axiomatizing resource bounds for measure
• A recursive and a grammatical characterization of the exponential-time languages
• Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
• Pseudo-natural algorithms for finitely generated presentations of monoids and groups
• Finite complete rewriting systems and the complexity of word problem
• Some undecidability results for non-monadic Church-Rosser Thue systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044553)