Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques

Pierre Lescanne

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1976)

  • Volume: 10, Issue: R2, page 57-81
  • ISSN: 0988-3754

How to cite

top

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 10.R2 (1976): 57-81. <http://eudml.org/doc/92034>.

@article{Lescanne1976,
author = {Lescanne, Pierre},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {R2},
pages = {57-81},
publisher = {EDP-Sciences},
title = {Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques},
url = {http://eudml.org/doc/92034},
volume = {10},
year = {1976},
}

TY - JOUR
AU - Lescanne, Pierre
TI - Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1976
PB - EDP-Sciences
VL - 10
IS - R2
SP - 57
EP - 81
LA - fre
UR - http://eudml.org/doc/92034
ER -

References

top
  1. 1. H. BEKIC, Definable Operations in General Algebras and the Theoryof Automata and Flowcharts, I B.M., Vienna, 1969. 
  2. 2. G. BIRKHOFF, Lattice Theory, American Math. Soc, Coll., vol 25, 3e édition, 1967. Zbl0153.02501MR227053
  3. 3. P. M. COHN, Universal Algebra, Van Nostrand, Princeton, 1965. Zbl0141.01002MR175948
  4. 4. N. CHOMSKY, On Certain Formal Properties of Grammars, Inf. and Control, 2, 1959, p. 137-167. Zbl0088.10801MR105365
  5. 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. 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. Zbl0302.68019MR428768
  7. 7. S. EILENBERG, Automata Languages and Machines, vol. A, Academic Press (1974). Zbl0317.94045MR530382
  8. 8. S. EILENBERG et J. B. WRIGHT, Automata in General Algebras, Inf. and Control, 11, 1967, p. 452-470. Zbl0175.27902MR223285
  9. 9. N. D. GAUTAM, The Validity of Equations of Complex Algebras, Arch. Math. Logik Grundlagenforsch, 3, 1957, p. 117-127. Zbl0081.26005MR92750
  10. 10. G. GRATZER, Universal Algebra, Van Nostrand, 1968. Zbl0182.34201MR248066
  11. 11. J. GRUSKA, A Characterization of Context Free Languages, J. Comput System Sc., 5, 1971, p. 353-364. Zbl0226.68035MR327090
  12. 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. Zbl0387.68011MR495103
  13. 13. J. E. HOPCROFT et J. D. ULLMANN, Formal Languages and Their Relation to Automata, Addison Wesley, 1969. Zbl0196.01701MR237243
  14. 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. MR77478
  15. 15. F. W. LAWVERE, Functorial Semantics of Algebraic Theories, Proc. Math. Acad. Sc. U.S.A., 50, 1963, p. 869-872. Zbl0119.25901MR158921
  16. 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. 17. I. P. MC WHIRTER, Substitution Expressions, J. Comput Systems Sc., 5, 1971, p. 629-637. Zbl0229.68026MR309371
  18. 18. J. MEZEI et J. B. WRIGHT, Algebraic Automata and Context-Free Sets, Inf. and Control, 11, 1967, p. 3-29. Zbl0155.34301MR234775
  19. 19. B. PAREIGIS, Categories and Functors, Academic Press, 1970. Zbl0211.32402MR265428
  20. 20. D. SCOTT et J. W. DE BAKKER, A Theory of Programs, unpublished notes I.B.M. Seminar, Vienna, 1969. 
  21. 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. Zbl0157.02201MR224476
  22. 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. Zbl0278.68069MR405947
  23. 23. M. WAND, A Concrete Approach to Abstract Recursive Definitions in Automata, Languages and Programming (M. NIVAT ed.), North Holland, 1972, p. 331-341. Zbl0278.68066MR366767
  24. 24. J. ENGELFRIET, Simple Program Schemes and Formal Languages, Lecture Notes in Computer Science, 20, Springer Verlag, 1974. Zbl0288.68030MR502130

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.