Match-bounded string rewriting systems

Applicable Algebra in Engineering, Communications and Computing

Volumn 15, Issue 3-4, 2004, Pages 149-171

  Geser, Alfons ^a   Hofbauer, Dieter ^b   Waldmann, Johannes ^c  

^a NATIONAL INSTITUTE OF AEROSPACE   (United States)

^b Fb IMN ^*  (Germany)

^c Fachbereich Naturwissenschaften   (Germany)

Author keywords

Match bounded; Semi Thue System; String Rewriting System; Termination

Indexed keywords

CRYPTOGRAPHY; FINITE AUTOMATA; MATHEMATICAL MODELS; NETWORK PROTOCOLS; TREES (MATHEMATICS); XML;

AUTOMATED TERMINATION PROOF; MATCH-BOUNDEDNESS; SEMI-THUE SYSTEM; STRING REWRITING SYSTEM;

PATTERN MATCHING;

EID: 10644223705     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-004-0162-8     Document Type: Article

References (33)

1. Book, R.V., Jantzen, M., Wrathall, C: Monadic Thue systems. Theoret. Comput. Sci. 19, 231-251 (1982)
2. Book, R.V., Otto, F.: String-Rewriting Systems. Texts Monogr. Comput. Sci. Springer-Verlag, New York, 1993
3. Chidlovskii, B.: Using regular tree automata as XML schemas. In: J. Hoppenbrouwers, T. de Souza Lima, M. Papazoglou, A. Sheth (eds.), Proc. IEEE Advances in Digital Libraries ADL-00, IEEE Comput. Society, 2000, pp. 89-98
4. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages. Vol. 1, Springer-Verlag, 1998, pp. 329-438
5. Coquand, T., Persson, H.: A proof-theoretical investigation of Zantema's problem. In: M. Nielsen, W. Thomas (eds.), Proc. 11th Annual Conf. of the EACSL CSL-97. Lecture Notes in Comput. Sci. Vol. 1414, Springer-Verlag, 1998, pp. 177-188
6. Dershowitz, N.: Termination of linear rewriting systems. In: S. Even, O. Kariv (eds.), Proc. 8th Int. Coll. Automata, Languages and Programming ICALP-81. Lecture Notes in Comput. Sci. Vol. 115, Springer-Verlag, 1981, pp. 448-458
7. Dershowitz, N.: Termination of rewriting. J. Symbolic Comput. 3(1-2), 69-115 (1987)
8. Dershowitz, N., Hoot, C.: Topics in termination. In: C. Kirchner (ed.), Proc. 5th Int. Conf. Rewriting Techniques and Applications RTA-93. Lecture Notes in Comput. Sci. Vol. 690, Springer-Verlag, 1993, pp. 198-212
9. Ferreira, M.C.F., Zantema, H.: Dummy elimination: Making termination easier. In: H. Reichel (ed.), 10th Int. Symp. Fundamentals of Computation Theory FCT-95. Lecture Notes in Comput. Sci. Vol. 965, Springer-Verlag, 1995, pp. 243-252
10. Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: D. A. McAllester (ed.), 17th Int. Conf. Automated Deduction CADE-17. Lecture Notes in Artificial Intelligence Vol. 1831, Springer-Verlag, 2000, pp. 271-290
11. Geser, A. : Is Termination Decidable for String Rewriting with only One Rule? Habilitations-schrift. Eberhard-Karls-Universität Tübingen, Germany, 2001
12. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. In: B. Rovan, P. Vojtas (eds.), Proc. 28th Int. Symp. Mathematical Foundations of Computer Science MFCS-03. Lecture Notes in Comput. Sci. Vol. 2747, Springer-Verlag, 2003, pp. 449-459
13. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems and automated termination proofs. In: A. Rubio (ed.), Proc. 6th Int. Workshop on Termination WST03. Technical Report DSIC-II/15/03, Universidad Politécnica de Valencia, Spain, 2003, pp. 19-22
14. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Finding finite automata that certify termination of string rewriting. In: K. Salomaa, S. Yu (eds.), Proc. 9th Int. Conf. Implementation and Application of Automata CIAA-04. Lecture Notes in Comput. Sci. to appear. Springer-Verlag, 2004
15. Geser, A., Zantema, H.: Non-looping string rewriting. RAIRO - Theoret. Inform. Appl. 33, 279-302 (1999)
16. Ginsburg, S., Greibach, S.A.: Mappings which preserve context sensitive languages. Inform. Control. 9(6), 563-582 (1966)
17. Hibbard, T.N.: Context-limited grammars. J. ACM 21(3), 446-453 (1974)
18. Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. In: Z. Ésik, Z. Fülöp (eds.), Proc. 7th Int. Conf. Developments in Language Theory DLT-03. Lecture Notes in Comput. Sci. Vol. 2710, Springer-Verlag, 2003, pp. 337-348. Full version accepted for publication in Theoret. Comput. Sci.
19. Kobayashi, Y., Katsura, M., Shikishima-Tsuji, K.: Termination and derivational complexity of confluent one-rule string-rewriting systems. Theoret. Comput. Sci. 262(1-2), 583-632 (2001)
20. Kurth, W: Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany, 1990
21. Lankford, D.S., Musser, D.R.: A finite termination criterion. Technical Report, Information Sciences Institute, Univ. of Southern California, Marina-del-Rey, CA, 1978
22. McNaughton, R.: Semi-Thue systems with an inhibitor. J. Automat. Reason. 26, 409-431 (2001)
23. Moczydłowski, W: Jednoregulowe systemy przepisywania slöw. Masters thesis, Warsaw University, Poland, 2002
24. Moczydłowski, W., Geser, A.: Termination of single-threaded one-rule Semi-Thue systems - revised version. Unpublished manuscript, National Institute of Aerospace, Hampton, VA, 2004. Available at http://research.nianet. orgrgeser/papers/single-revised.html
25. Moore, C., Eppstein, D.: One-dimensional peg solitaire, and duotaire. In: R.J. Nowakowski (ed.), More Games of No Chance. Cambridge Univ. Press, 2003
26. Ravikumar, B.: Peg-solitaire, string rewriting systems and finite automata. In: H.-W. Leong, H. Imai, S. Jain (eds.), Proc. 8th Int. Symp. Algorithms and Computation ISAAC-97. Lecture Notes in Comput. Sci. Vol. 1350, Springer-Verlag, 1997, pp. 233-242
27. The RTA list of open problems, http://www.lsv.ens-cachan.fr/rtaloop/
28. Sénizergues, G.: On the termination problem for one-rule semi-Thue systems. In: H. Ganzinger (ed.), Proc. 7th Int. Conf. Rewriting Techniques and Applications RTA-96. Lecture Notes in Comput. Sci. Vol. 1103, Springer-Verlag, 1996, pp. 302-316
29. Tahhan Bittar, E.: Complexité linéaire du problème de Zantema. C. R. Acad. Sci. Paris Sér. I Inform. Théor. t. 323, 1201-1206 (1996)
30. Waldmann, J.: Rewrite games. In: S. Tison (ed.), Proc. 13th Int. Conf. Rewriting Techniques and Applications RTA-02. Lecture Notes in Comput. Sci. Vol. 2378, Springer-Verlag, 2002, pp. 144-158
31. Zantema, H. : Termination of term rewriting: interpretation and type elimination. J. Symbolic Comput. 17(1), 23-50 (1994)
32. Zantema, H.: The termination hierarchy for term rewriting. Appl. Algebra Engrg. Comm. Comput. 12(1-2), 3-19 (2001)
33. s. Appl. Algebra Engrg. Comm. Comput. 11(1), 1-25 (2000)