Operations preserving recognizable languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 343-354

  Berstel, Jean ^a   Boasson, Luc ^b   Carton, Olivier ^b   Petazzoni, Bruno ^c   Pin, Jean Éric ^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

COMPUTATION THEORY;

FILTERING PROBLEMS; NATURAL GENERALIZATION; PERIODIC SEQUENCE; RECOGNIZABLE LANGUAGES; UNIFIED APPROACH;

COMPUTATIONAL LINGUISTICS;

EID: 33644775899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_32     Document Type: Article

References (16)

1. J. Berstel, Transductions and context-free languages, Teubner, Stuttgart, (1979).
2. O. Carton and W. Thomas, The monadic theory of morphic infinite words and generalizations, in MFCS 2000, Lecture Notes in Computer Science 1893, M. Nielsen and B. Rovan, eds, (2000), 275-284.
3. O. Carton and W. Thomas, The monadic theory of morphic infinite words and generalizations, Inform. Comput. 176, (2002), 51-76.
4. S. R. Kosaraju, Finite state automata with markers, in Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, Princeton, N. J. (1970), 380.
5. S. R. Kosaraju, Regularity preserving functions, SIGACT News 6 (2), (1974), 16-17. Correction to "Regularity preserving functions", SIGACT News 6 (3), (1974), 22.
6. S. R. Kosaraju, Context-free preserving functions, Math. Systems Theory 9, (1975), 193-197.
7. 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.
8. A. B. Matos, Regularity-preserving letter selections, DCC-FCUP Internal Report.
9. J.-É. Pin and J. Sakarovitch, Operations and transductions that preserve rationality, in 6th GI Conference, Lecture Notes in Computer Science 145, Springer Verlag, Berlin, (1983), 617-628.
10. J.-É. Pin and J. Sakarovitch, Une application de la représentation matricielle des transductions, Theoret. Comp. Sci. 35 (1985), 271-293.
11. J. I. Seiferas, A note on prefixes of regular languages, SIGACT News 6, (1974), 25-29.
12. J. I. Seiferas and R. McNaughton, Regularity-preserving relations, Theoret. Comp. Sci. 2, (1976), 147-154.
13. D. Siefkes, Decidable extensions of monadic second order successor arithmetic, in: Automatentheorie und formale Sprachen, (Mannheim, 1970), J. Dörr and G. Hotz, Eds, B.I. Hochschultaschenbücher, 441-472.
14. R. E. Stearns and J. Hartmanis, Regularity preserving modifications of regular expressions, Information and Control 6, (1963), 55-69.
15. Guo-Qiang Zhang, Automata, Boolean matrices, and ultimate periodicity, Information and Computation, 152, (1999), 138-154.
16. Guo-Qiang Zhang, Periodic functions for finite semigroups, preprint.