Sur les automates circulaires et la conjecture de Černý
RAIRO-Theor. Inf. Appl., 32 1-3 (1998) 21-34
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
(2024)
https://doi.org/10.2139/ssrn.4819005
Developments in Language Theory
Jakub RuszilLecture Notes in Computer Science, Developments in Language Theory 13911 208 (2023)
https://doi.org/10.1007/978-3-031-33264-7_17
Binary and circular automata having maximal state complexity for the set of synchronizing words
Stefan HoffmannInformation and Computation 295 105076 (2023)
https://doi.org/10.1016/j.ic.2023.105076
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
Eugenija A. Bondar, David Casas and Mikhail V. VolkovInternational Journal of Foundations of Computer Science 34 (06) 655 (2023)
https://doi.org/10.1142/S0129054123450053
LATIN 2022: Theoretical Informatics
David Casas and Mikhail V. VolkovLecture Notes in Computer Science, LATIN 2022: Theoretical Informatics 13568 345 (2022)
https://doi.org/10.1007/978-3-031-20624-5_21
Синхронизация конечных автоматов
Mikhail Vladimirovich VolkovУспехи математических наук 77 (5(467)) 53 (2022)
https://doi.org/10.4213/rm10005
Synchronization of finite automata
Mikhail Vladimirovich VolkovRussian Mathematical Surveys 77 (5) 819 (2022)
https://doi.org/10.4213/rm10005e
Cerny’s Conjecture for Automata with Simple Idempotents
I. K. RystsovCybernetics and Systems Analysis (2022)
https://doi.org/10.1007/s10559-022-00428-3
Simplicity of Augmentation Submodules for Transformation Monoids
M. H. Shahzamanian and B. SteinbergAlgebras and Representation Theory 24 (4) 1029 (2021)
https://doi.org/10.1007/s10468-020-09977-7
Extremal synchronizing circular automata
Yong He, Xueping Chen, Gang Li and Shiyuan SunInformation and Computation 281 104817 (2021)
https://doi.org/10.1016/j.ic.2021.104817
13037 38 (2021)
https://doi.org/10.1007/978-3-030-93489-7_4
Circular automata synchronize with high probability
Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez, Emanuele Rodaro and Amnon RosenmannJournal of Combinatorial Theory, Series A 178 105356 (2021)
https://doi.org/10.1016/j.jcta.2020.105356
Slowly synchronizing automata with fixed alphabet size
Henk Don, Hans Zantema and Michiel de BondtInformation and Computation 279 104614 (2021)
https://doi.org/10.1016/j.ic.2020.104614
Synchronizing sequences for road colored digraphs
Mariusz Grech and Andrzej KisielewiczDiscrete Applied Mathematics 285 128 (2020)
https://doi.org/10.1016/j.dam.2020.04.029
Developments in Language Theory
Jarkko Kari, Andrew Ryzhikov and Anton VaronkaLecture Notes in Computer Science, Developments in Language Theory 11647 74 (2019)
https://doi.org/10.1007/978-3-030-24886-4_5
On the Interplay Between Černý and Babai’s Conjectures
François Gonze, Vladimir V. Gusev, Raphaël M. Jungers, Balázs Gerencsér and Mikhail V. VolkovInternational Journal of Foundations of Computer Science 30 (01) 93 (2019)
https://doi.org/10.1142/S0129054119400057
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
Emanuele RodaroJournal of Algebraic Combinatorics 50 (3) 237 (2019)
https://doi.org/10.1007/s10801-018-0851-1
Complexity of road coloring with prescribed reset words
Vojtěch Vorel and Adam RomanJournal of Computer and System Sciences 104 342 (2019)
https://doi.org/10.1016/j.jcss.2016.05.009
Strongly connected synchronizing automata and the language of minimal reset words
Emanuele RodaroAdvances in Applied Mathematics 99 158 (2018)
https://doi.org/10.1016/j.aam.2018.04.006
Developments in Language Theory
François Gonze and Raphaël M. JungersLecture Notes in Computer Science, Developments in Language Theory 11088 330 (2018)
https://doi.org/10.1007/978-3-319-98654-8_27
Developments in Language Theory
Vladimir V. Gusev, Raphaël M. Jungers and Daniel PrůšaLecture Notes in Computer Science, Developments in Language Theory 11088 379 (2018)
https://doi.org/10.1007/978-3-319-98654-8_31
10977 312 (2018)
https://doi.org/10.1007/978-3-319-94812-6_26
A machine learning approach to synchronization of automata
Igor Podolak, Adam Roman, Marek Szykuła and Bartosz ZielińskiExpert Systems with Applications 97 357 (2018)
https://doi.org/10.1016/j.eswa.2017.12.043
Language and Automata Theory and Applications
Henk Don and Hans ZantemaLecture Notes in Computer Science, Language and Automata Theory and Applications 10168 249 (2017)
https://doi.org/10.1007/978-3-319-53733-7_18
Developments in Language Theory
François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers and Mikhail V. VolkovLecture Notes in Computer Science, Developments in Language Theory 10396 185 (2017)
https://doi.org/10.1007/978-3-319-62809-7_13
Algebraic synchronization criterion and computing reset words
Mikhail V. Berlinkov and Marek SzykułaInformation Sciences 369 718 (2016)
https://doi.org/10.1016/j.ins.2016.07.049
Descriptional Complexity of Formal Systems
Eugenija A. Bondar and Mikhail V. VolkovLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9777 1 (2016)
https://doi.org/10.1007/978-3-319-41114-9_1
Černý conjecture for edge-colored digraphs with few junctions
Mariusz Grech and Andrzej KisielewiczElectronic Notes in Discrete Mathematics 54 115 (2016)
https://doi.org/10.1016/j.endm.2016.09.021
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
François Gonze and Raphaël M. JungersSIAM Journal on Discrete Mathematics 30 (2) 995 (2016)
https://doi.org/10.1137/15M1024603
Implementation and Application of Automata
Andrzej Kisielewicz, Jakub Kowalski and Marek SzykułaLecture Notes in Computer Science, Implementation and Application of Automata 9705 176 (2016)
https://doi.org/10.1007/978-3-319-40946-7_15
Representation Theory of Finite Monoids
Benjamin SteinbergUniversitext, Representation Theory of Finite Monoids 191 (2016)
https://doi.org/10.1007/978-3-319-43932-7_13
Mathematical Foundations of Computer Science 2015
Mikhail Berlinkov and Marek SzykułaLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2015 9234 103 (2015)
https://doi.org/10.1007/978-3-662-48057-1_8
Language and Automata Theory and Applications
François Gonze and Raphaël M. JungersLecture Notes in Computer Science, Language and Automata Theory and Applications 8977 212 (2015)
https://doi.org/10.1007/978-3-319-15579-1_16
Cliques and colorings in generalized Paley graphs and an approach to synchronization
Csaba Schneider and Ana C. SilvaJournal of Algebra and Its Applications 14 (06) 1550088 (2015)
https://doi.org/10.1142/S0219498815500887
Independent sets of words and the synchronization problem
Arturo Carpi and Flavio DʼAlessandroAdvances in Applied Mathematics 50 (3) 339 (2013)
https://doi.org/10.1016/j.aam.2012.07.003
The Synchronizing Probability Function of an Automaton
Raphaël M. JungersSIAM Journal on Discrete Mathematics 26 (1) 177 (2012)
https://doi.org/10.1137/100816109
Computation, Physics and Beyond
Arto SalomaaLecture Notes in Computer Science, Computation, Physics and Beyond 7160 403 (2012)
https://doi.org/10.1007/978-3-642-27654-5_31
Implementation and Application of Automata
Vladimir V. GusevLecture Notes in Computer Science, Implementation and Application of Automata 7381 171 (2012)
https://doi.org/10.1007/978-3-642-31606-7_15
Implementation and Application of Automata
Mikhail V. BerlinkovLecture Notes in Computer Science, Implementation and Application of Automata 7381 90 (2012)
https://doi.org/10.1007/978-3-642-31606-7_8
Complexity of problems concerning reset words for cyclic and Eulerian automata
Pavel MartyuginTheoretical Computer Science 450 3 (2012)
https://doi.org/10.1016/j.tcs.2012.04.022
Implementation and Application of Automata
Krzysztof Chmiel and Adam RomanLecture Notes in Computer Science, Implementation and Application of Automata 6482 79 (2011)
https://doi.org/10.1007/978-3-642-18098-9_9
ON A CONJECTURE BY CARPI AND D'ALESSANDRO
MIKHAIL V. BERLINKOVInternational Journal of Foundations of Computer Science 22 (07) 1565 (2011)
https://doi.org/10.1142/S012905411100888X
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
MARIE-PIERRE BÉAL, MIKHAIL V. BERLINKOV and DOMINIQUE PERRINInternational Journal of Foundations of Computer Science 22 (02) 277 (2011)
https://doi.org/10.1142/S0129054111008039
Reachability Problems
Vladimir V. GusevLecture Notes in Computer Science, Reachability Problems 6945 180 (2011)
https://doi.org/10.1007/978-3-642-24288-5_16
THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
BENJAMIN STEINBERGInternational Journal of Foundations of Computer Science 22 (07) 1697 (2011)
https://doi.org/10.1142/S0129054111008970
A lower bound for the length of the shortest carefully synchronizing words
P. V. MartyuginRussian Mathematics 54 (1) 46 (2010)
https://doi.org/10.3103/S1066369X10010056
Developments in Language Theory
Benjamin SteinbergLecture Notes in Computer Science, Developments in Language Theory 6224 423 (2010)
https://doi.org/10.1007/978-3-642-14455-4_38
Developments in Language Theory
Arturo Carpi and Flavio D’AlessandroLecture Notes in Computer Science, Developments in Language Theory 6224 124 (2010)
https://doi.org/10.1007/978-3-642-14455-4_13
Mathematical Foundations of Computer Science 2010
Dmitry Ananichev, Vladimir Gusev and Mikhail VolkovLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2010 6281 55 (2010)
https://doi.org/10.1007/978-3-642-15155-2_7
Černý’s conjecture and group representation theory
Benjamin SteinbergJournal of Algebraic Combinatorics 31 (1) 83 (2010)
https://doi.org/10.1007/s10801-009-0185-0
Experiments on Synchronizing Automata
Adam RomanSchedae Informaticae 19 (-1) 35 (2010)
https://doi.org/10.2478/v10149-011-0003-z
Mathematical Foundations of Computer Science 2009
Arturo Carpi and Flavio D’AlessandroLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2009 5734 211 (2009)
https://doi.org/10.1007/978-3-642-03816-7_19
Synchronizing finite automata with short reset words
Adam RomanApplied Mathematics and Computation 209 (1) 125 (2009)
https://doi.org/10.1016/j.amc.2008.06.019
Developments in Language Theory
Marie-Pierre Béal and Dominique PerrinLecture Notes in Computer Science, Developments in Language Theory 5583 81 (2009)
https://doi.org/10.1007/978-3-642-02737-6_6
Synchronizing automata preserving a chain of partial orders
M.V. VolkovTheoretical Computer Science 410 (37) 3513 (2009)
https://doi.org/10.1016/j.tcs.2009.03.021
Developments in Language Theory
Jorge Almeida and Benjamin SteinbergLecture Notes in Computer Science, Developments in Language Theory 5583 67 (2009)
https://doi.org/10.1007/978-3-642-02737-6_5
Language and Automata Theory and Applications
Adam RomanLecture Notes in Computer Science, Language and Automata Theory and Applications 5457 684 (2009)
https://doi.org/10.1007/978-3-642-00982-2_58
Language and Automata Theory and Applications
Mikhail V. VolkovLecture Notes in Computer Science, Language and Automata Theory and Applications 5196 11 (2008)
https://doi.org/10.1007/978-3-540-88282-4_4
Algorithms for media
David Eppstein and Jean-Claude FalmagneDiscrete Applied Mathematics 156 (8) 1308 (2008)
https://doi.org/10.1016/j.dam.2007.05.035
Developments in Language Theory
Arturo Carpi and Flavio D’AlessandroLecture Notes in Computer Science, Developments in Language Theory 5257 240 (2008)
https://doi.org/10.1007/978-3-540-85780-8_19
A series of slowly synchronizing automata with a zero state over a small alphabet
P.V. MartuginInformation and Computation 206 (9-10) 1197 (2008)
https://doi.org/10.1016/j.ic.2008.03.020
Some Aspects of Synchronization of DFA
Avraham TrahtmanJournal of Computer Science and Technology 23 (5) 719 (2008)
https://doi.org/10.1007/s11390-008-9165-4
Synchronization
Helmut JürgensenInformation and Computation 206 (9-10) 1033 (2008)
https://doi.org/10.1016/j.ic.2008.03.005
Synchronizing automata with a letter of deficiency 2
D.S. Ananichev, M.V. Volkov and Yu.I. ZaksTheoretical Computer Science 376 (1-2) 30 (2007)
https://doi.org/10.1016/j.tcs.2007.01.010
Developments in Language Theory
D. S. Ananichev, M. V. Volkov and Yu. I. ZaksLecture Notes in Computer Science, Developments in Language Theory 4036 433 (2006)
https://doi.org/10.1007/11779148_39
Synchronizing groups and automata
Fredrick Arnold and Benjamin SteinbergTheoretical Computer Science 359 (1-3) 101 (2006)
https://doi.org/10.1016/j.tcs.2006.02.003
WORDS GUARANTEEING MINIMUM IMAGE
S. W. MARGOLIS, J.-E. PIN and M. V. VOLKOVInternational Journal of Foundations of Computer Science 15 (02) 259 (2004)
https://doi.org/10.1142/S0129054104002406
Synchronizing monotonic automata
D.S. Ananichev and M.V. VolkovTheoretical Computer Science 327 (3) 225 (2004)
https://doi.org/10.1016/j.tcs.2004.03.068
Developments in Language Theory
Dimitry S. Ananichev and Mikhail V. VolkovLecture Notes in Computer Science, Developments in Language Theory 2710 111 (2003)
https://doi.org/10.1007/3-540-45007-6_8
The Essence of Computation
Arto SalomaaLecture Notes in Computer Science, The Essence of Computation 2566 37 (2002)
https://doi.org/10.1007/3-540-36377-7_3
On codes with a finite deciphering delay: constructing uncompletable words
Jean Néraud and Carla SelmiTheoretical Computer Science 255 (1-2) 151 (2001)
https://doi.org/10.1016/S0304-3975(99)00160-7