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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1949-2018
05101519492017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such that… (More)
Is this relevant?
2008
2008
Let PCP(k) denote the following restriction of the well-known Post Correspondence Problem [9]: given alphabet Σ of cardinality k… (More)
Is this relevant?
2006
2006
In the first sections we extend and generalize Gröbner basis theory to submodules of free right modules over monoid rings. Over… (More)
Is this relevant?
2005
2005
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order… (More)
Is this relevant?
2001
2001
A semi-Thue system with an inhibitor is one having a special symbol, called an inhibitor, that appears on the right side of every… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating… (More)
Is this relevant?
1990
1990
Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-free… (More)
  • figure 1
  • figure 2
Is this relevant?
1986
1986
A semi-Thue system S (Thue system T) is self-embedding if there exist words x, y and z such that xz ~ e and y ~*xyz(y*-,*xyz… (More)
Is this relevant?
1985
1985
We present a single-axiom Thue system with a decidable word problem for which there does not exist any finite equivalent… (More)
Is this relevant?