Automates et grammaires polygraphiques

A. Burroni

Diagrammes (2012)

  • Volume: 67-68, page 9-32
  • ISSN: 0224-3911

How to cite

top

Burroni, A.. "Automates et grammaires polygraphiques." Diagrammes 67-68 (2012): 9-32. <http://eudml.org/doc/272967>.

@article{Burroni2012,
author = {Burroni, A.},
journal = {Diagrammes},
language = {fre},
pages = {9-32},
publisher = {Université Paris 7, Unité d'enseignement et de recherche de mathématiques},
title = {Automates et grammaires polygraphiques},
url = {http://eudml.org/doc/272967},
volume = {67-68},
year = {2012},
}

TY - JOUR
AU - Burroni, A.
TI - Automates et grammaires polygraphiques
JO - Diagrammes
PY - 2012
PB - Université Paris 7, Unité d'enseignement et de recherche de mathématiques
VL - 67-68
SP - 9
EP - 32
LA - fre
UR - http://eudml.org/doc/272967
ER -

References

top
  1. - [Bat 98] M. A. BataninMonoidal Globular Categories As a Natural Environment for the Theory of Weak n-Categories. Advances in Mathematics136, 39-103 (1998) Zbl0912.18006
  2. - [Bu 71] A. Burroni: Thèse de 3e cycle. Paris1971. 
  3. - [Bu 87] A. Burroni : Conférence (non-publiée) aux Journées d'Etudes E.L.I.T. 27 juin- 2 juillet (1988) Paris. 
  4. - [Bu 89] A. Burroni : Congrès international Bangor. juillet 1989. 
  5. - [Bu 89'] A. Burroni : Congrès Saint Jacques de Compostelle. Septembre 1989 
  6. - [Bu 91] A. Burroni : Higher dimensional word problem. LNCS530 (septembre 1991) 94-105 Zbl0788.18004
  7. - [Bu 93] A. Burroni : Higher-dimensional word problems with applications to equational logic. Theoretical Computer Science, 115 :43-62, 1993. Zbl0791.08004
  8. - [Bu 02] A. Burroni : Automatas and Grammars of Higher Dimensions. (http ://www.math.jussieu.fr/ burroni/). Marseille Luminy (http ://iml.univ-mrs.fr/ lafont/li2002/semaine2.html) 
  9. - [Bu 02'] Conférence à un Séminaire (SIC) du 16 mars 2002 à Tours. 
  10. - [Ehr 63] Charles Ehresmann : catégories structurées. Annales scientifique de l'E.N.S.3e série, tome 80, n° 4 (1963). 349-426. Zbl0128.02002
  11. - [Guir 06] Yves Guiraud. Two polygraphics présentations of Petri net. Annals of Pure and Applied Logic141, n°1-2, 266-295, 2006. 
  12. - [Met 03] François Métayer. Résolutions by polygraphs. Theory and Applications of Categories, 
  13. - [Pow 91] John Power. An n-categorical pasting theorem. In Category Theory, Proc. Int. Conf., Como/Italy 1990, number 1488 in Lect. Notes Math., pages 326-358, 1991. Zbl0736.18004

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.