EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 1-3 (1998) RAIRO-Theor. Inf. Appl., 32 1-3 (1998) 21-34 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 1-3, 1998
Page(s) 21 - 34
DOI https://doi.org/10.1051/ita/1998321-300211
Published online 01 February 2017
  1. [Čer64] J. ČERNÝ, Poznámka k homogénnym experimenton s konečnými automatmi, Mat. fyz. čas. SAV., 1964, 14, p. 208-215. [EuDML: 29801] [MR: 168429] [Zbl: 0137.01101] [Google Scholar]
  2. [Čer71] J. ČERNÝ, On directable automata, Kybernetika, 1971, 7, p. 4. [MR: 302347] [Zbl: 0223.94029] [Google Scholar]
  3. [Dub96] L. DUBUC, Les automates circulaires biaises vérifient la conjecture de Černý, Informatique théorique et Applications, 1996, 30, n° 6, p. 495-505. [EuDML: 92548] [MR: 1454826] [Zbl: 0877.68083] [Google Scholar]
  4. [Epp90] D. EPPSTEIN, Reset sequences for monotonic automata, SIAM J. Comput, June 1990, 19, 3, p. 500-510. [MR: 1041543] [Zbl: 0698.68058] [Google Scholar]
  5. [Fra82] P. FRANKL, An extremal problem for two families of sets, Europ. J. Combinatorics, 1982, p. 125-127. [MR: 670845] [Zbl: 0488.05004] [Google Scholar]
  6. [Gor92] P. GORALČÍK et V. KOUBEK, Rank problems for composite transformations, IJAC, 1995, 5, n° 3, p. 309-316. [MR: 1331737] [Zbl: 0831.20089] [Google Scholar]
  7. [Koh70] Z. KOHAVI, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970, p. 414-416. [MR: 411805] [Zbl: 0206.47701] [Google Scholar]
  8. [Pin77] 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. [MR: 439469] [Zbl: 0364.94073] [Google Scholar]
  9. [Pin78a] J.-E. PIN, Sur un cas particulier de la conjecture de Černý, Communication 5e colloque "On automata languages and programming" 1978, Udine (Italie). [MR: 520853] [Zbl: 0389.68036] [Google Scholar]
  10. [Pin78b] 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. [Google Scholar]
  11. [Pin78c] J.-E. PIN, Sur un cas particulier de la conjecture de Černý, Proc. 5th ICALP, Lect. Notes in Comp. Sci., Springer Verlag, Berlin, Heidelberg, New York, 1978, 62, p. 345-352. [MR: 520853] [Zbl: 0389.68036] [Google Scholar]
  12. [Pin78d] J.-E. PIN, Sur les mots synchronisants dans un automate fini, Elektron. Informationsverarb. Kybernet., 1978, 14, p. 293-303. [MR: 530266] [Zbl: 0392.68051] [Google Scholar]
  13. [Pin78e] 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. [Zbl: 0482.68053] [Google Scholar]
  14. [Pin81] J.-E. PIN, Le problème de la synchronisation et la conjecture de Černý, Noncommutative structures in algebra and geometrie combinatorics, De Luca, A.ed., Quaderni de la Ricerca Scientifica, CNR, Roma, 1981, 109, p. 37-48. [MR: 646476] [Zbl: 0543.68039] [Google Scholar]
  15. [Pin83] J.-E. PIN, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics, 1983, 17, p. 535-548. [MR: 841339] [Zbl: 0523.68042] [Google Scholar]
  16. [Rys95] I. K. RYSTSOV, Quasioptimal bounds for the length of reset words for regular automata, Acta Cybernetica, 1995, 12, n° 2, p. 145-152. [MR: 1370976] [Zbl: 0844.68085] [Google Scholar]
  17. [Sav] P. SAVICKÝ et S. VANĔČEK, Search of synchronizing words for finite automata with aid of linear algebra, unpublished manuscript. [Google Scholar]
  18. [Sta66] P. H. STARKE, Eine Bemerkung über homogene Experimente, Elektron. Information-verarbeit. Kybernetik, 1966, 2, p. 257-259. [Zbl: 0166.27003] [Google Scholar]
  19. [Sta69] P. H. STARKE, Abstrakte Automaten, VEB Deutscher Verlag der Wissenschaft, (1969), Abstract Automata, North Holland, Amsterdam, (1972). [MR: 276016] [Zbl: 0182.02102] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.