Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,525,183 papers from all fields of science
Search
Sign In
Create Free Account
Semi-Thue system
Known as:
Semi-Thue grammar
, Thue system
, String rewriting system
Expand
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Abstract rewriting system
Chomsky hierarchy
Empty string
Formal grammar
Expand
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
F. Nicolas
arXiv.org
2008
Corpus ID: 1560350
Let PCP(k) denote the Post Correspondence Problem for k input pairs of strings. Let ACCESSIBILITY(k) denote the the word problem…
Expand
2003
2003
Qué rol asignan los profesores de física de nivel medio a los modelos científicos y a las actividades de modelado
Stella Maris Islas
,
M. Pesa
2003
Corpus ID: 178566913
Se presentan los resultados de una investigacion exploratoria realizada con metodologia cualitativa en una muestra de profesores…
Expand
Highly Cited
1999
Highly Cited
1999
Semi-Selfsimilar Processes
M. Maejima
,
Ken-iti Sato
1999
Corpus ID: 15798271
A notion of semi-selfsimilarity of Rd-valued stochastic processes is introduced as a natural extension of the selfsimilarity…
Expand
1999
1999
From String Rewriting to Logical Metabolic Systems
V. Manca
,
Domenico Marco Martina
Grammatical Models of Multi-Agent Systems
1999
Corpus ID: 40813807
In this paper we focus on the notion of metabolism and the way it can be expressed in symbolic terms. We show as an adequate…
Expand
1992
1992
Conditional Semi-thue Systems for Presenting Monoids 1
Thomas Deii
1992
Corpus ID: 17937585
There are well known examples of monoids in literature which do not admit a nite and canonical presentation by a semi-Thue system…
Expand
1991
1991
Decidable Sentences for Context-Free Groups
K. Madlener
,
F. Otto
Symposium on Theoretical Aspects of Computer…
1991
Corpus ID: 1814210
The linear sentences of Book [1983] are a class of logical formulae particularly well-suited for describing certain properties of…
Expand
1991
1991
Divergence Phenomena during Completion
Andrea Sattler-Klein
International Conference on Rewriting Techniques…
1991
Corpus ID: 30356060
We will show how any primitive recursive function may be encoded in a finite canonical string rewriting system. Using these…
Expand
1983
1983
THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS†
R. V. Book
1983
Corpus ID: 116604909
1981
1981
Finite and infinite regular thue systems
C. Ó'Dúnlaing
1981
Corpus ID: 1448987
This dissertation studies certain classes of Thue system, concentrating on the Church-Rosser property. The following new results…
Expand
1972
1972
Combinatorial Systems. I. Cylindrical Problems
J. Cleave
Journal of computer and system sciences (Print)
1972
Corpus ID: 26462213
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)
ACCEPT & CONTINUE