Non-Looping String Rewriting
RAIRO-Theor. Inf. Appl., 33 3 (1999) 279-301
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Non-termination in Term Rewriting and Logic Programming
Étienne PayetJournal of Automated Reasoning 68 (1) (2024)
https://doi.org/10.1007/s10817-023-09693-z
On prefixal one-rule string rewrite systems
Michel Latteux and Yves RoosTheoretical Computer Science 795 240 (2019)
https://doi.org/10.1016/j.tcs.2019.07.004
Non-Termination of Cycle Rewriting by Finite Automata
Jörg EndrullisElectronic Proceedings in Theoretical Computer Science 225 3 (2016)
https://doi.org/10.4204/EPTCS.225.2
Automated Reasoning
Fabian Emmes, Tim Enger and Jürgen GieslLecture Notes in Computer Science, Automated Reasoning 7364 225 (2012)
https://doi.org/10.1007/978-3-642-31365-3_19
Loop detection in term rewriting using the eliminating unfoldings
Étienne PayetTheoretical Computer Science 403 (2-3) 307 (2008)
https://doi.org/10.1016/j.tcs.2008.05.013
Term Rewriting and Applications
Nachum DershowitzLecture Notes in Computer Science, Term Rewriting and Applications 3467 376 (2005)
https://doi.org/10.1007/978-3-540-32033-3_28
Termination of String Rewriting Proved Automatically
H. ZantemaJournal of Automated Reasoning 34 (2) 105 (2005)
https://doi.org/10.1007/s10817-005-6545-0
Decision problems for semi-Thue systems with a few rules
Yuri Matiyasevich and Géraud SénizerguesTheoretical Computer Science 330 (1) 145 (2005)
https://doi.org/10.1016/j.tcs.2004.09.016
Match-Bounded String Rewriting Systems
Alfons Geser, Dieter Hofbauer and Johannes WaldmannApplicable Algebra in Engineering, Communication and Computing 15 (3-4) 149 (2004)
https://doi.org/10.1007/s00200-004-0162-8
Rewriting Techniques and Applications
Alfons GeserLecture Notes in Computer Science, Rewriting Techniques and Applications 2378 267 (2002)
https://doi.org/10.1007/3-540-45610-4_19
On normalizing, non-terminating one-rule string rewriting systems
Alfons GeserTheoretical Computer Science 243 (1-2) 489 (2000)
https://doi.org/10.1016/S0304-3975(00)00167-5