ON REAL-TIME WORD PROBLEMS

DOI10.1112/S0024610702003770MaRDI QIDQ4467832zbMATH OpenOpenAlexFDO

Authors Derek F. Holt, Claas E. Röver

Publication date 10 June 2004

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024610702003770

zbMATH Keywords

multitape real-time Turing machinerestricted wreath productword problem of a group

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Word problems, etc. in computability and recursion theory (03D40) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
• SOLVING THE WORD PROBLEM IN REAL TIME
• The complexity of Dehn's algorithm for word problems in groups
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
• Word problems of groups: formal languages, characterizations and decidability

Cited in

(1)

• WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM

This page was built for publication: ON REAL-TIME WORD PROBLEMS

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