A. Caron, Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties, In TAPSOFT, vol.1, pp.74-89, 1991.
DOI : 10.1007/3-540-53982-4_5

M. Dauchet, Termination of rewriting is undecidable in the one-rule case, MFCS, pp.262-270, 1988.

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

A. Geser, Decidability of Termination of Grid String Rewriting Rules, SIAM Journal on Computing, vol.31, issue.4, pp.1156-1168, 2002.
DOI : 10.1137/S009753979833297X

A. Geser, Loops of Superexponential Lengths in One-Rule String Rewriting, RTA, pp.267-280, 2002.
DOI : 10.1007/3-540-45610-4_19

A. Geser, Termination of String Rewriting Rules That Have One Pair of Overlaps, RTA, pp.410-423, 2003.
DOI : 10.1007/3-540-44881-0_29

A. Geser and H. Zantema, Non-Looping String Rewriting, RAIRO - Theoretical Informatics and Applications, vol.33, issue.3, pp.279-302, 1999.
DOI : 10.1051/ita:1999118

S. Ginsburg, The Mathematical Theory of Context-Free Languages, 1966.

S. Ginsburg and E. H. Spanier, Bounded algol-like languages. Transactions of the, pp.333-368, 1964.

J. V. Guttag, D. Kapur, and D. R. Musser, On Proving Uniform Termination and Restricted Termination of Rewriting Systems, SIAM Journal on Computing, vol.12, issue.1, pp.189-214, 1983.
DOI : 10.1137/0212012

W. Kurth, One-rule semi-Thue systems with loops of length one, two or three, RAIRO - Theoretical Informatics and Applications, vol.30, issue.5, pp.415-429, 1996.
DOI : 10.1051/ita/1996300504151

M. Latteux and Y. Roos, The image of a word by a one-rule semi-Thue system is not always context-free, 2011.

M. Latteux and Y. Roos, A new proof for the uniform termination problem of one-rule grid semi-Thue systems, 2011.

Y. Matiyasevich and G. Sénizergues, Decision problems for semi-Thue systems with a few rules, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.523-531, 1996.
DOI : 10.1109/LICS.1996.561469

R. Mcnaughton, Well behaved derivations in one-rule semi-thue systems, 1995.

R. Mcnaughton, Semi-thue systems with an inhibitor, Journal of Automated Reasoning, vol.26, issue.4, pp.409-431, 2001.
DOI : 10.1023/A:1010759024900

W. Moczydlowski and A. Geser, Termination of Single-Threaded One-Rule Semi-Thue Systems, RTA, pp.338-352, 2005.
DOI : 10.1007/978-3-540-32033-3_25

M. Sakai and Y. Wang, Undecidable Properties on Length-Two String Rewriting Systems, Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, pp.53-69, 2007.
DOI : 10.1016/j.entcs.2008.03.053

G. Sénizergues, Some undecidable termination problems for semi-Thue systems, Theoretical Computer Science, vol.142, issue.2, pp.257-276, 1995.
DOI : 10.1016/0304-3975(94)00278-9

G. Sénizergues, On the termination problem for one-rule semi-Thue system, RTA, pp.302-316, 1996.
DOI : 10.1007/3-540-61464-8_61

C. Wrathall, Confluence of one-rule Thue systems, IWWERT '90: Proceedings of the First International Workshop on Word Equations and Related Topics, pp.237-246, 1992.
DOI : 10.1007/3-540-55124-7_11

W. Yi, S. Masahiko, and N. Naoki, Confluence of length preserving string rewriting systems is undecidable(theory of computer science and its applications), RIMS Kokyuroku, vol.1554, pp.171-177, 2007.

H. Zantema and A. Geser, A Complete Characterization of Termination of 0 p 1 q ??? 1 r 0 s, Applicable Algebra in Engineering, Communication and Computing, vol.11, issue.1, pp.1-25, 2000.
DOI : 10.1007/s002009900019