Recherche et téléchargement d’archives de revues mathématiques numérisées

 
 
  Table des matières de ce fascicule | Article suivant
Aalbersberg, Ijsbrand Jan; Welzl, Emo
Trace languages defined by regular string languages. Informatique théorique et applications, 20 no. 2 (1986), p. 103-119
Texte intégral djvu | pdf | Analyses MR 860763 | Zbl 0612.68071 | 3 citations dans Numdam

URL stable: http://www.numdam.org/item?id=ITA_1986__20_2_103_0

Bibliographie

1. IJ.J. AALBERSBERG and G. ROZENBERG, Traces - a Survey, Techn. Rep. 85-16, Inst. of Appl. Math. and Comput. Sc., Univ. of Leiden, Leiden, 1985.
2. IJ. J. AALBERSBERG and G. ROZENBERG, Traces, Dependency Graphs and DNLC Grammars, Discrete Appl. Math, Vol. 11, 1985, pp.299-306.  MR 792896 |  Zbl 0601.68045
3. A. BERTONI, M. BRAMBILLA, G. MAURI and N. SABADINI, An Application of the Theory of Free Partially Commutative Monoids : Asymptotic Densities of Trace Languages, Lecture Notes in Computer Science, Vol. 118, 1981, pp. 205-215.  Zbl 0468.68081
4. A. BERTONI, G. MAURI and N. SABADINI, A Hierarchy of Regular Trace Languages and Sorne Combinatorial Applications, Proc. 2nd.World Conf. on Math, at the Service of Men, Las Palmas, 1982, pp.146-153.  Zbl 0512.68056
5. A. BERTONI, G. MAURI and N. SABADINI, Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71.  MR 675445 |  Zbl 0486.68079
6. A. BERTONI, G. MAURI and N. SABADINI, Unambiguous Regular Trace Languages, to appear in Algebra, Combinatorics and Logic in Comput. Sc. (to appear), Colloquia Math. Soc. J. Bolay.  MR 875858 |  Zbl 0627.68060
7. R. CORI and D. PERRIN, Automates et Commutations Partielles, R.A.I.R.O., Inform. Théor., Vol. 19, 1985, pp. 21-32.
Numdam |  MR 795769 |  Zbl 0601.68055
8. M. FLEISS, Matrices de Hankel, J. Math. Pures Appl., Vol. 53, 1974, pp. 197-222.  MR 364328 |  Zbl 0315.94051
8. S. GINSBURG, The Mathematical Theory of Context Free Languages, Mc-Graw-Hill Book Company, New York, London, 1966.  MR 211815 |  Zbl 0184.28401
10. J. E. HOPCROFT and J. D. ULLMAN, Introduction to automata theory, languages and computation, Addison -Wesley, Reading, Mass, 1979.  MR 645539 |  Zbl 0426.68001
11. G. LALLEMENT, Semigroups and combinatorial applications, J. Wiley and Sons, New York, 1979.  MR 530552 |  Zbl 0421.20025
12. A. MAZURKIEWICZ, Concurrent Program Schemes and Their Interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus, 1977.
13. A. MAZURKIEWICZ, Traces, Histories, Graphs: Instances of a Process Monoid, Lecture Notes in Computer Science, Vol. 176, 1984, pp.115-133.  MR 783441 |  Zbl 0577.68061
14. A. MAZURKIEWICZ, Semantics of Concurrent Systems: a Modular Fixed-Point Trace Approach, Lecture Notes in Computer Science, Vol. 188, 1985, pp.353-375.  MR 807209 |  Zbl 0576.68044
15. J. SAKAROVITCH, On Regular Trace Languages, R.A.I.R.O., Inform. Théor. (to appear).  MR 918113
16. A. SALOMAA, Theory of automata, Pergamon Press, Oxford - New York, 1969.  MR 262021 |  Zbl 0193.32901
17. A. SALOMAA, Formal languages, Academic Press, New York, 1973.  MR 438755 |  Zbl 0262.68025
18. M. SZIJARTO, A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours, Fund. Inform., Vol. 4, 1981, pp. 531-549.  MR 678010 |  Zbl 0486.68074
19. A. TARLECKI, Notes on the Implementability of Formal Languages by Concurrent Systems, ICS PAS Rep. 481, Inst. of Comput. Sc., Polish Acad. of Sc., Warshaw, 1982.
Copyright Cellule MathDoc 2014 | Crédit | Plan du site