| Issue |
RAIRO-Theor. Inf. Appl.
Volume 49, Number 3, July-September 2015
|
|
|---|---|---|
| Page(s) | 233 - 254 | |
| DOI | https://doi.org/10.1051/ita/2015008 | |
| Published online | 26 November 2015 | |
Reducing the gradedness problem of string rewriting systems to a termination problem∗
Department of Mathematics, Bar Ilan University,
52900
Ramat Gan,
Israel
Steinita@gmail.com
Received:
30
January
2015
Accepted:
4
November
2015
A finite string rewriting system (SRS) is called graded if every word over its alphabet is equivalent to only a finite number of other words. We consider the problem of deciding whether a given finite SRS is graded. We show that, in general, this problem is not decidable. Moreover we show that for many SRSs (including all one-rule SRSs), one can convert the SRS to another SRS such that the original one is graded if and only if the converted one is terminating. Since there are computer programs that can decide for many cases whether a given SRS is terminating or not, this can give us a method to prove automatically if a given SRS is graded or not.
Mathematics Subject Classification: 68Q42
Key words: String rewriting / termination / gradedness
© EDP Sciences 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.