Les automates circulaires biaisés vérifient la conjecture de Černý

L. Dubuc

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

  • Volume: 30, Issue: 6, page 495-505
  • ISSN: 0988-3754

How to cite

top

Dubuc, L.. "Les automates circulaires biaisés vérifient la conjecture de Černý." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.6 (1996): 495-505. <http://eudml.org/doc/92548>.

@article{Dubuc1996,
author = {Dubuc, L.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Černý conjecture; biased circular actions},
language = {fre},
number = {6},
pages = {495-505},
publisher = {EDP-Sciences},
title = {Les automates circulaires biaisés vérifient la conjecture de Černý},
url = {http://eudml.org/doc/92548},
volume = {30},
year = {1996},
}

TY - JOUR
AU - Dubuc, L.
TI - Les automates circulaires biaisés vérifient la conjecture de Černý
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1996
PB - EDP-Sciences
VL - 30
IS - 6
SP - 495
EP - 505
LA - fre
KW - Černý conjecture; biased circular actions
UR - http://eudml.org/doc/92548
ER -

References

top
  1. [Čer 64] J. ČERNÝ et K. POZNÁMKA, Homogénnym experimenton s Konečnými automatmi. Mat. fyz. cas. SAV., 1964, 14, p. 208-215. Zbl0137.01101MR168429
  2. [čer 71] J. ČERNÝ, On directable automata, Kybernetïka 7, 1971, p. 4. Zbl0223.94029MR302347
  3. [Fra 82] P. FRANKL, An extremal problem for two families of sets, Europ, J. Combinatorics, 1982, p. 125-127. Zbl0488.05004MR670845
  4. [Gor 92] P. GORALČÍK et V. KOUBEK, Rank problems for composite transformations, à paraître dans IJAC. Zbl0831.20089
  5. [Koh 70] Z. KOHAVI, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970, p. 414-416. Zbl0206.47701MR411805
  6. [Pin 77] J. E. PIN, Sur la longueur des mots de rang donné d'un automate fini, C. R. Acad. Sc. A, 1977, 284, p. 1233-1235. Zbl0364.94073MR439469
  7. [Pin 78a] J. E. PIN, Sur un cas particulier de la conjecture de Černý, Communication faite au 5e colloque "On automata languages and programming", 1978, Udine (Italie). Zbl0389.68036MR520853
  8. [Pin 78b] J. E. PIN, Le problème de la synchronisation. Contribution à l'étude de la conjecture de Černý, Thèse de 3e cycle à l'université Pierre et Marie Curie (Paris 6), 1978. 
  9. [Pin 78c] J. E. PIN, Sur un cas particulier de la conjoncture de Černý, Proc. 5th ICALP, Lect. Notes in Comp. Sci 62, Springer Verlag, Berlin, Heidelberg, New York, 1978, p. 345-352. Zbl0389.68036MR520853
  10. [Pin 78d] J. E. PIN, Sur les mots synchronisants dans un automate fini, Elektron. Informationsverarb. Kybernet., 1978, 14, p. 293-303. Zbl0392.68051MR530266
  11. [Pin 78e] J. E. PIN, Utilisation de l'algèbre linéaire en théorie des automates, Actes du 1er Colloque AFCET-SMF de Mathématiques Appliquées, AFCET, 1978, p. 85-92. Zbl0482.68053
  12. [Pin 81] J. E. PIN, Le problème de la synchronisation et la conjecture de Černý, Non-commutative structures in algebra and geometric combinatorics, De Luca, A. éd., Quaderni de la Ricerca Scientifica, CNR, Roma, 1981, 109, p. 37-48. Zbl0543.68039MR646476
  13. [Pin 83] J. E. PIN, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics, 1983, 17, p. 535 -548. Zbl0523.68042MR841339
  14. [Sav] P. SAVICKÝ et S. VANĔČEK, Search of synchronizing words for finite automata with aid of linear algebra, unpublished manuscript. 
  15. (Sta 66] P. H. STARKE, Eine Bemerkung über homogene Experimente, Elektron. Information-verarbeit. Kybernetik, 1966, 2, p. 257-259. Zbl0166.27003
  16. [Sta 69] P. H. STARKE, Abstrakte Automaten, VEB Deutscher Verlag der Wissenschaft, 1969, Abstract Automata, North Holland, Amsterdam, 1972. Zbl0182.02102MR276016

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.