Deleting string rewriting systems preserve regularity

Theoretical Computer Science

Volumn 327, Issue 3, 2004, Pages 301-317

  Hofbauer, Dieter ^a   Waldmann, Johannes ^b  

^a Fachbereich IMN ^*  (Germany)

^b LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

Context free languages; Preserving regularity; Regular languages; String rewriting systems

Indexed keywords

COMPUTER SCIENCE; INVERSE PROBLEMS; MATHEMATICAL TRANSFORMATIONS; SET THEORY;

MONADIC REWRITING; PRESERVING REGULARITY; STRING REWRITING SYSTEMS;

CONTEXT FREE LANGUAGES;

EID: 6344231663     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.009     Document Type: Conference Paper

References (19)

1. J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.
2. R.V. Book, M. Jantzen, C. Wrathall, Monadic Thue systems, Theoret. Comput. Sci. 19 (1982) 231-251.
3. R.V. Book, F. Otto, String-Rewriting Systems, in: Texts and Monographs in Computer Science, Springer, New York, 1993.
4. J.R. Büchi, Regular canonical systems, Arch. Math. Logik Grundlagenforschung 6 (1964) 91-111.
5. J.R. Büchi, in: D. Siefkes (Ed.), Finite Automata, Their Algebras and Grammars - Towards a Theory of Formal Expressions, Springer, New York, 1989.
6. J.R. Büchi, W.H. Hosken, Canonical systems which produce periodic sets, Math. Syst. Theory 4 (1970) 81-90.
7. N. Dershowitz, Z. Manna, Proving termination with multiset orderings, Comm. ACM 22 (8) (1979) 465-476.
8. R. Fraïssé, Theory of Relations, Studies in Logic and the Foundations of Mathematics, Vol. 118, North-Holland, Amsterdam, 1986.
9. A. Geser, D. Hofbauer, J. Waldmann, Match-bounded string rewriting systems, in: B. Rovan, P. Vojtas (Eds.), Proc. 28th Internat. Symp. Mathematical Foundations of Computer Science MFCS-03, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003, pp. 449-459.
10. A. Geser, D. Hofbauer, J. Waldmann, Match-bounded string rewriting systems, NIA Report 2003-09, National Institute of Aerospace, Hampton, VA, USA, available at http://research.nianet.org/~geser/papers/nia-matchbounded.html, Appl. Algebra Eng. Comm. Comput., to appear.
11. S. Ginsburg, S.A. Greibach, Mappings which preserve context sensitive languages, Inform. Control 9 (6) (1966) 563-582.
12. T.N. Hibbard, Context-limited grammars, J. ACM 21 (3) (1974) 446-453.
13. D. Hofbauer, J. Waldmann, Deleting string rewriting systems preserve regularity, in: Z. Ésik, Z. Fülöp (Eds.), Proc. 7th Internat. Conf. Developments in Language Theory DLT-03, Lecture Notes in Computer Science, Vol. 2710, Springer, Berlin, 2003, pp. 337-348.
14. M.I. Kratko, A class of Post calculi, Soviet Math. Dokl. 6 (6) (1965) 1544-1545.
15. F. Otto, Some undecidability results concerning the property of preserving regularity, Theoret. Comput. Sci. 207 (1998) 43-72.
16. E.L. Post, Formal reductions of the general combinatorial decision problem, Amer. J. Math. 65 (1943) 197-215.
17. B. Ravikumar, Peg-solitaire, string rewriting systems and finite automata, in: H.-W. Leong, H. Imai, S. Jain (Eds.), Proc. 8th Internat. Symp. Algorithms and Computation ISAAC-97, Lecture Notes in Computer Science, Vol. 1350, Springer, Berlin, 1997, pp. 233-242.
18. S. Tison, Tree automata and term rewrite systems, in: L. Bachmair (Ed.), Proc. 11th Internat. Conf. Rewriting Techniques and Applications RTA-00, Lecture Notes in Computer Science, Vol. 1833, Springer, Berlin, 2000, pp. 27-30.
19. S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1998, pp. 41-110.