Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques
Lescanne, Pierre
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976), p. 57-81 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1976-01-01
@article{ITA_1976__10_2_57_0,
     author = {Lescanne, Pierre},
     title = {\'Equivalence entre la famille des ensembles r\'eguliers et la famille des ensembles alg\'ebriques},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {10},
     year = {1976},
     pages = {57-81},
     mrnumber = {418532},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1976__10_2_57_0}
}

Lescanne, Pierre. Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976) pp. 57-81. http://gdmltest.u-ga.fr/item/ITA_1976__10_2_57_0/

1. H. Bekic, Definable Operations in General Algebras and the Theoryof Automata and Flowcharts, I B.M., Vienna, 1969.

2. G. Birkhoff, Lattice Theory, American Math. Soc, Coll., vol 25, 3e édition, 1967. | MR 227053 | Zbl 0153.02501

3. P. M. Cohn, Universal Algebra, Van Nostrand, Princeton, 1965. | MR 175948 | Zbl 0141.01002

4. N. Chomsky, On Certain Formal Properties of Grammars, Inf. and Control, 2, 1959, p. 137-167. | MR 105365 | Zbl 0088.10801

5. J. W. De Bakker, Fixed Points in Programming Theory in Foundations of Computer Science (J. W. De BAKKER ed., Mathematical Center Tracts, 63, Mathematisch Centrum Amsterdam, 1974, p. 1-49.

6. W. P. De Roever, Recursion and Parameters Mechanisms, Axiomatic Approach in Automata, Languages and Programming (J. LOECKX ed.), Lectures Notes in Computer Sciences, vol. 14, Springer Verlag, Berlin 1974, p. 34-65. | MR 428768 | Zbl 0302.68019

7. S. Eilenberg, Automata Languages and Machines, vol. A, Academic Press (1974). | MR 530382 | Zbl 0317.94045

8. S. Eilenberg et J. B. Wright, Automata in General Algebras, Inf. and Control, 11, 1967, p. 452-470. | MR 223285 | Zbl 0175.27902

9. N. D. Gautam, The Validity of Equations of Complex Algebras, Arch. Math. Logik Grundlagenforsch, 3, 1957, p. 117-127. | MR 92750 | Zbl 0081.26005

10. G. Gratzer, Universal Algebra, Van Nostrand, 1968. | MR 248066 | Zbl 0182.34201

11. J. Gruska, A Characterization of Context Free Languages, J. Comput System Sc., 5, 1971, p. 353-364. | MR 327090 | Zbl 0226.68035

12. P. Hitchcock et D. Park, Induction Rules and Termination Proofs in Automata, Languages and Programming (M. NIVAT ed.), North-Holland, 1972, p. 225-251. | MR 495103 | Zbl 0387.68011

13. J. E. Hopcroft et J. D. Ullmann, Formal Languages and Their Relation to Automata, Addison Wesley, 1969. | MR 237243 | Zbl 0196.01701

14. S. G. Kleene, Representations of Events in Nerves Nets and Finite Automata in Automata Studies (C. E. SHANNON and J. MCCARTHY eds.), Princeton Univ. Press, Princeton, New Jersey, 1956, p. 3-42. | MR 77478

15. F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proc. Math. Acad. Sc. U.S.A., 50, 1963, p. 869-872. | MR 158921 | Zbl 0119.25901

16. P. Lescanne, Étude de quelques théories des langages et généralisation du théorème de Kleene, Thèse de 3e Cycle, Université de Nancy, 1971.

17. I. P. Mc Whirter, Substitution Expressions, J. Comput Systems Sc., 5, 1971, p. 629-637. | MR 309371 | Zbl 0229.68026

18. J. Mezei et J. B. Wright, Algebraic Automata and Context-Free Sets, Inf. and Control, 11, 1967, p. 3-29. | MR 234775 | Zbl 0155.34301

19. B. Pareigis, Categories and Functors, Academic Press, 1970. | MR 265428 | Zbl 0211.32402

20. D. Scott et J. W. De Bakker, A Theory of Programs, unpublished notes I.B.M. Seminar, Vienna, 1969.

21. J. W. Thatcher et J. B. Wright, Generalized Automata Theory with an Application to a Decision Problem of Second Order Logic, Math. Systems Theory- 2, 1968, p. 57-81. | MR 224476 | Zbl 0157.02201

22. R. Turner, An Infinite Hierarchy of Terms Languages and Approach to Mathematical Complexity in Automata, Languages and Programming (M. NIVAT ed.), North Holland, 1972, p. 593-608. | MR 405947 | Zbl 0278.68069

23. M. Wand, A Concrete Approach to Abstract Recursive Definitions in Automata, Languages and Programming (M. NIVAT ed.), North Holland, 1972, p. 331-341. | MR 366767 | Zbl 0278.68066

24. J. Engelfriet, Simple Program Schemes and Formal Languages, Lecture Notes in Computer Science, 20, Springer Verlag, 1974. | MR 502130 | Zbl 0288.68030