Skip to search formSkip to main contentSkip to account menu

Semi-Thue system

Known as: Semi-Thue grammar, Thue system, String rewriting system 
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Abstract rewriting systemChomsky hierarchyEmpty stringFormal grammar

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
(Generalized) Post Correspondence Problem and semi-Thue systems
Let PCP(k) denote the Post Correspondence Problem for k input pairs of strings. Let ACCESSIBILITY(k) denote the the word problem… 
2003
2003
Semi-Lévy processes, semi-selfsimilar additive processes, and semi-stationary Ornstein-Uhlenbeck type processes
The works of Wolfe [27], Jurek and Vervaat [6], Sato and Yamazato [20], [21], Sato [16], and Jeanblanc, Pitman, and Yor [4… 
2001
2001
Logical string rewriting
Highly Cited
1999
Highly Cited
1999
Semi-Selfsimilar Processes
A notion of semi-selfsimilarity of Rd-valued stochastic processes is introduced as a natural extension of the selfsimilarity… 
Highly Cited
1993
Highly Cited
1993
Computing Gröbner bases in monoid and group rings
Grobner bases and Buchberger's algorithm have been generalized to monoid and group rings. In this paper we summarize procedures… 
1992
1992
Topological essentiality and differential inclusions
In the present paper a concept of topological essentiality for a large class of multivalued mappings is introduced. This concept… 
Highly Cited
1985
Highly Cited
1985
Reductions in Tree Replacement Systems
1983
1983
THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS†
1968
1968
Some Remarks on Derivations in General Rewriting Systems
1949
1949
The word problem for semigroups with two generators
Emil Post has shown that the word problem for Thue systems is unsolvable. A Thue system is a system of strings of letters x1, x2… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)