Operations preserving regular languages

Theoretical Computer Science

Volumn 354, Issue 3, 2006, Pages 405-420

  Berstel, Jean ^a   Boasson, Luc ^b   Carton, Olivier ^b   Petazzoni, Bruno ^c   Pin, Jean Eric ^b  

^a Université de Marne la Vallée   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c Lycée Marcelin Berthelot   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; WORD PROCESSING;

FILTERING PROBLEMS; NON-NEGATIVE INTEGERS;

FORMAL LANGUAGES;

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

References (19)

1. J. Almeida Finite semigroups and universal algebra 1994 World Scientific Publishing Co. Inc. River Edge, NJ (Translated from the 1992 Portuguese original and revised by the author)
2. J. Berstel Transductions and Context-free Languages 1979 Teubner Stuttgart
3. J. Berstel, L. Boasson, O. Carton, B. Petazzoni, J.-E. Pin, Operations preserving recognizable languages, in: A. Lingas, B.J. Nilsson (Eds.), FCT'2003, Lecture Notes in Computer Science, vol. 2751, 2003, pp. 343-354.
4. O. Carton, and W. Thomas The monadic theory of morphic infinite words and generalizations Inform. and Comput. 176 2002 51 76
5. J.H. Conway Regular Algebra and Finite Machines 1971 Chapman & Hall London
6. S. Ginsburg The Mathematical Theory of Context-free Languages 1966 McGraw-Hill Book Co. New York
7. S.R. Kosaraju, Finite state automata with markers, in: Proc. Fourth Annual Princeton Conf. Information Sciences and Systems, Princeton, NJ, 1970, 380.
8. S.R. Kosaraju Regularity preserving functions SIGACT News 6 2 1974 16 17 (Correction to "Regularity preserving functions", SIGACT News 6(3) (1974) 22)
9. S.R. Kosaraju Context-free preserving functions Math. Systems Theory 9 3 1975 193 197
10. D. Kozen On regularity-preserving functions Bull. Europ. Assoc. Theor. Comput. Sc. 58 1996 131 138 (Erratum: On regularity-preserving functions, Bull. Europ. Assoc. Theor. Comput. Sc. 59 (1996) 455)
11. A.B. Matos, Regularity-preserving letter selections. DCC-FCUP Internal Report, Porto, Portugal.
12. J.-E. Pin, J. Sakarovitch, Operations and transductions that preserve rationality, in: 6th GI Conf., Lecture Notes in Computer Science 145, 1983, pp. 617-628.
13. J.-E. Pin, and J. Sakarovitch Une application de la représentation matricielle des transductions Theoret. Comp. Sci. 35 1985 271 293
14. J. Sakarovitch Éléments de théorie des automates 2003 Vuibert Paris
15. D. Siefkes, Decidable extensions of monadic second order successor arithmetic, in: Automatentheorie und formale Sprachen (Tagung, Math. Forschungsinst., Oberwolfach, 1969), Bibliographisches Inst., Mannheim, 1970, pp. 441-472.
16. J.I. Seiferas A note on prefixes of regular languages SIGACT News 6 1974 25 29
17. J.I. Seiferas, and R. McNaughton Regularity-preserving relations Theoret. Comput. Sci. 2 1976 147 154
18. R.E. Stearns, and J. Hartmanis Regularity preserving modifications of regular expressions Inform. and Control 6 1963 55 69
19. G.-Q. Zhang, Periodic functions for finite semigroups, Preprint.