Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties [chapter]

A-C Caron
1991 Lecture Notes in Computer Science  
We prove that termination is undecidable for non-length-increashlg string rewriting systems, using linear-bounded automala. On the other hand, we prove the undecidability of confluence for terminating rewriting systems when temas begin by a fixed symbol. These two results illustrate that sometimes restriction of problem to recognizable donaains modify decidability properties, sometimes it does not. (We only consider finite terms).
doi:10.1007/3-540-53982-4_5 fatcat:2y753c4nqbdivmpiylkqncpyoy