Automates et commutations partielles

Robert Cori; Dominique Perrin

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

  • Volume: 19, Issue: 1, page 21-32
  • ISSN: 0988-3754

How to cite

top

Cori, Robert, and Perrin, Dominique. "Automates et commutations partielles." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.1 (1985): 21-32. <http://eudml.org/doc/92219>.

@article{Cori1985,
author = {Cori, Robert, Perrin, Dominique},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {closure; recognition; partial commutation rule; finite automaton},
language = {fre},
number = {1},
pages = {21-32},
publisher = {EDP-Sciences},
title = {Automates et commutations partielles},
url = {http://eudml.org/doc/92219},
volume = {19},
year = {1985},
}

TY - JOUR
AU - Cori, Robert
AU - Perrin, Dominique
TI - Automates et commutations partielles
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 1
SP - 21
EP - 32
LA - fre
KW - closure; recognition; partial commutation rule; finite automaton
UR - http://eudml.org/doc/92219
ER -

References

top
  1. 1. P. CARTIER et D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., n° 85, 1969, Springer Verlag. Zbl0186.30101MR239978
  2. 2. S. EILENBERG, Automata, Languages and Machines, vol. A, 1974, Academic Press. Zbl0317.94045MR530382
  3. 3. M. P. FLÉ et G. ROUCAIROL, On Serializability of Iterated Transaction, A.C.M. SIGACT-SIGOPS, 1982, p. 194-200. 
  4. 4. M. LOTHAIRE, Combinatorics on Words, 1983, Addison Wesley. Zbl0514.20045MR675953

Citations in EuDML Documents

top
  1. Wieslaw Zielonka, Notes on finite asynchronous automata
  2. Marc Chemillier, Monoïde libre et musique, première partie : les musiciens ont-ils besoin des mathématiques ?
  3. Ijsbrand Jan Aalbersberg, Emo Welzl, Trace languages defined by regular string languages
  4. Walter Vogler, A generalization of traces
  5. G. Guaiana, A. Restivo, S. Salemi, Complete subgraphs of bipartite graphs and applications to trace languages
  6. Roman R. Redziejowski, Schützenberger-like products in non-free monoids
  7. Jacqueline Lacaze, Parties reconnaissables de monoïdes définis par générateurs et relations
  8. A. Avellone, M. Goldwurm, Analysis of algorithms for the recognition of rational and context-free trace languages
  9. Marc Chemillier, Solfège, commutation partielle et automates de contrepoint
  10. A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg, On the structure of recognizable languages of dependence graphs

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.