On normalizing, non-terminating one-rule string rewriting systems

We prove that the one-rule string rewriting system 1010#->#010110 is normalizing, i.e admits for every string a reduction to normal form, but non-terminating, i.e. there are infinite reductions as well. Moreover we prove that this is the smallest such system. In the discourse we introduce the first method to prove normalizaiton for non-terminating string rewriting systems. (orig.)Available from TIB Hannover: RR 4367(96-34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman