@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 = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique}, pages = {57--81}, publisher = {Dunod-Gauthier-Villars}, address = {Paris}, volume = {10}, number = {R2}, year = {1976}, mrnumber = {418532}, language = {fr}, url = {http://archive.numdam.org/item/ITA_1976__10_2_57_0/} }
TY - JOUR AU - Lescanne, Pierre TI - Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques JO - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique PY - 1976 SP - 57 EP - 81 VL - 10 IS - R2 PB - Dunod-Gauthier-Villars PP - Paris UR - http://archive.numdam.org/item/ITA_1976__10_2_57_0/ LA - fr ID - ITA_1976__10_2_57_0 ER -
%0 Journal Article %A Lescanne, Pierre %T Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques %J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique %D 1976 %P 57-81 %V 10 %N R2 %I Dunod-Gauthier-Villars %C Paris %U http://archive.numdam.org/item/ITA_1976__10_2_57_0/ %G fr %F ITA_1976__10_2_57_0
Lescanne, Pierre. Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 10 (1976) no. R2, pp. 57-81. http://archive.numdam.org/item/ITA_1976__10_2_57_0/
1. Definable Operations in General Algebras and the Theoryof Automata and Flowcharts, I B.M., Vienna, 1969.
,2. Lattice Theory, American Math. Soc, Coll., vol 25, 3e édition, 1967. | MR | Zbl
,3. Universal Algebra, Van Nostrand, Princeton, 1965. | MR | Zbl
,4. On Certain Formal Properties of Grammars, Inf. and Control, 2, 1959, p. 137-167. | MR | Zbl
,5. 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. 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 | Zbl
,7. Automata Languages and Machines, vol. A, Academic Press (1974). | MR | Zbl
,8. Automata in General Algebras, Inf. and Control, 11, 1967, p. 452-470. | MR | Zbl
et ,9. The Validity of Equations of Complex Algebras, Arch. Math. Logik Grundlagenforsch, 3, 1957, p. 117-127. | MR | Zbl
,10. Universal Algebra, Van Nostrand, 1968. | MR | Zbl
,11. A Characterization of Context Free Languages, J. Comput System Sc., 5, 1971, p. 353-364. | MR | Zbl
,12. Induction Rules and Termination Proofs in Automata, Languages and Programming (M. NIVAT ed.), North-Holland, 1972, p. 225-251. | MR | Zbl
et ,13. Formal Languages and Their Relation to Automata, Addison Wesley, 1969. | MR | Zbl
et ,14. 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
,15. Functorial Semantics of Algebraic Theories, Proc. Math. Acad. Sc. U.S.A., 50, 1963, p. 869-872. | MR | Zbl
,16. É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. Substitution Expressions, J. Comput Systems Sc., 5, 1971, p. 629-637. | MR | Zbl
,18. Algebraic Automata and Context-Free Sets, Inf. and Control, 11, 1967, p. 3-29. | MR | Zbl
et ,19. Categories and Functors, Academic Press, 1970. | MR | Zbl
,20. A Theory of Programs, unpublished notes I.B.M. Seminar, Vienna, 1969.
et ,21. Generalized Automata Theory with an Application to a Decision Problem of Second Order Logic, Math. Systems Theory- 2, 1968, p. 57-81. | MR | Zbl
et ,22. 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 | Zbl
,23. A Concrete Approach to Abstract Recursive Definitions in Automata, Languages and Programming (M. NIVAT ed.), North Holland, 1972, p. 331-341. | MR | Zbl
,24. Simple Program Schemes and Formal Languages, Lecture Notes in Computer Science, 20, Springer Verlag, 1974. | MR | Zbl
,