Semi-commutations and partial commutations

M. Clerbout; Y. Roos; I. Ryl

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

  • Volume: 34, Issue: 4, page 307-330
  • ISSN: 0988-3754

How to cite

top

Clerbout, M., Roos, Y., and Ryl, I.. "Semi-commutations and partial commutations." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.4 (2000): 307-330. <http://eudml.org/doc/92637>.

@article{Clerbout2000,
author = {Clerbout, M., Roos, Y., Ryl, I.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {regular language},
language = {eng},
number = {4},
pages = {307-330},
publisher = {EDP-Sciences},
title = {Semi-commutations and partial commutations},
url = {http://eudml.org/doc/92637},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Clerbout, M.
AU - Roos, Y.
AU - Ryl, I.
TI - Semi-commutations and partial commutations
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 4
SP - 307
EP - 330
LA - eng
KW - regular language
UR - http://eudml.org/doc/92637
ER -

References

top
  1. [1] A. Arnold, An extension of the notions of traces and of asynchronous automata. Theoret. Informatics Appl. 25 (1991), 355-393. Zbl0765.68153MR1134387
  2. [2] M. Clerbout, Commutations Partielles et Familles de Langages. Ph. D. Thesis, Université des Sciences et Technologies de Lille (1984). 
  3. [3] M. Clerbout and D. Gonzalez, Atomic semi-commutations. Theoret. Comput. Sci. 123 (1994) 259-272. Zbl0801.68143MR1256201
  4. [4] M. Clerbout and M. Latteux, Partial commutations and faithful rational transductions. Theoret Comput. Sci. 34 (1984) 241-254. Zbl0548.68073MR773455
  5. [5] M. Clerbout and M. Latteux, Semi-commutations, Inform. and Comput. 73 (1987) 59-74. Zbl0629.68078
  6. [6] M. Clerbout, M. Latteux, Y. Roos and W. Zielonka, Semi-commutations and rational expressions, in Proc. 19th International Colloquium on Automata Languages and Programrning (ICALP'92), edited by W. Kuich. Springer, Lecture Notes in Comput. Sel 623 (1992) 113-125. MR1250634
  7. [7] V. Diekert and G. Rozenberg, The Book of Traces. World Scientific, Singapore (1995). MR1478992
  8. [8] C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. Zbl0135.00704MR216903
  9. [9] S. Ginsburg and S. A. GreibachPrincipal AFL. J. Comput System Sci. 4 (1970) 308-338. Zbl0198.03102MR286599
  10. [10] S. Ginsburg, The Mathemetical Theory of Context-Free Languages. McGraw-Hill (1966). Zbl0184.28401MR211815
  11. [11] J. F. Husson, Modélisation de la Causalité par des Relations d'Indépendance. Ph. D. Thesis, Université Paul Sabatier, Toulouse (1996). 
  12. [12] M. Latteux, Cônes rationnels commutativement clos. Theoret. Informatics Appl. 11 (1977) 29-51. Zbl0354.68103MR478782
  13. [13] A. Mazurkiewicz, Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University (1977). 
  14. [14] Y. Métivier, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. Theoret. Informatics Appl. 20 (1986) 121-127. Zbl0599.20107MR860764
  15. [15] E. Ochmański, Regular behaviour of concurrent Systems. Bull. EUT. ASSOC. Theoret. Comput. Sci. EATCS 27 (1985) 56-67. 
  16. [16] E. Ochmański and P. A. Wacrenier, On regular compatibility of semi-commutations, in Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP'93), edited by A. Lingas, R. Karlsson and S. Carlsson. Springer, Lecture Notes in Comput. Sci. 700 (1993) 445-456. MR1252425
  17. [17] W. Zielonka, Notes on finite asynchronous automata. Theoret. Informatics Appl. 21 (1987) 99-135. Zbl0623.68055MR894706

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.