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

  • A-C Caron
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


We prove that termination is undecidable for non-length-increasing string rewriting systems, using linear-bounded automata. On the other hand, we prove the undecidability of confluence for terminating rewriting systems when terms begin by a fixed symbol. These two results illustrate that sometimes restriction of problem to recognizable domains modify decidability properties, sometimes it does not. (We only consider finite terms).


Turing Machine Initial Configuration Computation Step Decision Property Congruence Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Book]
    Personnal communication.Google Scholar
  2. [Dauchet]
    Max Dauchet “Simulation of Turing Machines by a left-linear rewrite rule” Rewriting Techniques and Applications. 3rd international conference, RTA-89 Chapel Hill, North Carolina, USA, April 1989 Proceedings in LNCS 355 N. Dershowitz (Ed.) p 109–120 (1987)Google Scholar
  3. [Dershowitz]
    Nachum Dershowitz “Termination of Rewriting” J.Symbolic Computation (1987) 3, 69–116Google Scholar
  4. [Dershowitz & Jouannaud]
    N. Dershowitz and J.P. Jouannaud “Rewrite systems” Rapport de recherche 478. Unité associée au CNRS 410. (1989)Google Scholar
  5. [Hooper]
    Philip K. Hooper “The undecidability of the Turing machine immortality problem” J.Symbolic Logic 31 (2) June 1966. (1966)Google Scholar
  6. [Hopcroft & Ullman]
    J.E. Hopcroft and J.D. Ullman “Some results on tape-bounded Turing machines” J.A.C.M. Vol 16 (1), January 1967, pp 168–177.Google Scholar
  7. [Huet]
    Gérard Huet “Confluent reductions: abstact ptoperties and applications to term rewriting systems” J.A.C.M. Vol 27, (4), October 1980 pp 797–821. (1980)Google Scholar
  8. [Huet & Lankford]
    G. Huet and D.S. Lankford “On the uniform halting problem for term rewriting systems”, Rapport laboria 283, Institut de Recherche en Informatique et en automatique, Le Chesnay, France, Mars 1978. (1978)Google Scholar
  9. [Kuroda]
    S.-Y. Kuroda “Classes of languages and linear-bounded automata” Information and Controle 7, 207–223 (1964).Google Scholar
  10. [Litovsky & Metivier]
    Igor Litovsky and Yves Metivier “Computing with graph rewriting systems with priorities” Rapport interne LaBRI 90–87Google Scholar
  11. [Myhill]
    J. Myhill “Linear bounded automata” WADD Tech. Note No. 60-165, Wright-Patterson Air Force Base, Ohio. (1960)Google Scholar
  12. [Newman]
    M.H.A. Newman “On theories with a combinatorial definition of equivalence” Annals of Mathematics 43 (2), p. 223–243. (1942)Google Scholar
  13. [Otto]
    Friedrich Otto “On deciding the confluence of a finite string-rewriting system on a given congruence class” J. Comput. System Sciences 35, 285–310 (1987)Google Scholar
  14. [Post]
    Emil L. Post “A variant of a recursively unsolvable problem”. Bulletin of the American Mathematical Society 52 p 264–268. (1946)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • A-C Caron
    • 1
  1. 1.LIFL (URA 369-CNRS) UFR IEEAUniversité de Lille-Flandres-ArtoisVilleneuve d'Ascq CedexFrance

Personalised recommendations