semi-Thue systems

semi-Thue systems
Name	Semi-Thue system
Type	Rewriting system
Introduced	1947
Inventor	Axel Thue
Related	Thue system, Post correspondence problem, Markov algorithm

semi-Thue systems A semi-Thue system is a formal rewriting framework used in theoretical computer science and combinatorial algebra to model string replacement processes. Originating in the work of Axel Thue, it provides a basis for exploring computability, decidability, and word problems connected to groups and monoids. Semi-Thue systems connect to a broad network of developments involving Emil Post, Alonzo Church, Alan Turing, Noam Chomsky, and institutions such as Princeton University and University of Oslo.

Definition

A semi-Thue system consists of an alphabet A and a finite set R of ordered pairs (l, r) of words over A, called production rules, allowing replacement of an occurrence of l by r within any context. The rewriting relation generated by R, typically denoted =>, yields the reflexive-transitive closure yielding reachability of words; this relation underlies the word problem for presented monoids and groups. The formalism ties into notions from Emil Post's rewriting frameworks, Axel Thue's combinatorics on words, and later treatments by Alonzo Church and Stephen Kleene.

Examples

Classic examples include string rewriting presentations of free monoids, where R is empty, and of finitely presented monoids given by generator and relation lists studied at Université de Paris and University of Göttingen. Semi-Thue systems instantiate the rewriting rules used in Markov algorithm constructions and in reductions central to the Post correspondence problem explored by Emil Post and later by researchers at Princeton University and Harvard University. They model substitution systems used in works by Andrey Kolmogorov and Norbert Wiener in symbolic dynamics, and appear in encodings used in Alfred Tarski’s decision problem investigations.

Formal properties and variants

Variants include Thue systems (symmetric rules), string rewriting systems with length-reducing or length-preserving constraints, and confluent or terminating systems studied in the context of Gerhard Gentzen’s proof theory and Alfred Tarski’s algebraic logic. Confluence (Church–Rosser property) connects to results by Alonzo Church and J. Barkley Rosser, while termination (Noetherian property) relates to the well-foundedness notions explored by Christopher Zeeman and William Tait. Other formalizations appear in presentations of groups and monoids investigated by Max Dehn, Otto Schreier, and Issai Schur, with ties to rewriting techniques used in Graham Higman’s embedding theorems and John Conway’s combinatorial group theory.

Decision problems and decidability

The word problem for semi-Thue systems—deciding if two words are equivalent under the generated congruence—was shown undecidable in general by techniques related to Emil Post and Andrey Markov; reductions to the Halting problem and encodings of Turing machine computation are central in proofs by researchers linked to Princeton University and Moscow State University. Membership, reachability, and confluence decision problems vary in complexity: some restricted classes are decidable using algorithms stemming from work at University of California, Berkeley and Stanford University, while others remain undecidable as demonstrated in studies by Yuri Matiyasevich and collaborators. Connections to the Post correspondence problem illustrate boundary cases where decidability transitions to undecidability, echoing results by Emil Post and later refinements at Massachusetts Institute of Technology.

Computational and algebraic applications

Semi-Thue systems provide presentations of monoids and groups used in algebraic topology contexts investigated at University of Cambridge and Princeton University, and underpin automated theorem proving efforts at Carnegie Mellon University and University of Edinburgh. They serve as models for string rewriting engines in compilers and symbolic computation systems developed at Bell Labs and IBM Research, and inform complexity-theoretic constructions in work by Stephen Cook and Richard Karp. In combinatorics on words, connections to studies by Marston Morse, G. H. Hardy, and Jakob Nielsen surface, while applications to formal language theory relate to hierarchies studied by Noam Chomsky and researchers at Massachusetts Institute of Technology.

Historical development and notable results

The concept traces to Axel Thue’s early 20th-century investigations into word equations and patterns, further formalized in computability-era contributions by Emil Post in the 1940s and connected to Alan Turing’s machine model and Alonzo Church’s lambda calculus. Important milestones include undecidability proofs by Emil Post and Andrey Markov, Church–Rosser theorems by Alonzo Church and J. Barkley Rosser, and algorithmic advances from research groups at University of Manchester and University of Warsaw. Notable later results involve embedding theorems by Graham Higman, confluence criteria by Gerhard Gentzen and Pierre-Louis Lions, and applications to modern automated reasoning pursued at Stanford University and Microsoft Research.

Category:Rewriting systems