%0 Journal Article %1 journals/ijfcs/BealBP11 %A Béal, Marie-Pierre %A Berlinkov, Mikhail V. %A Perrin, Dominique %D 2011 %J Int. J. Found. Comput. Sci. %K %N 2 %P 277-288 %T A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs22.html#BealBP11 %V 22

@article{journals/ijfcs/BealBP11, added-at = {2023-12-12T19:40:24.000+0100}, author = {Béal, Marie-Pierre and Berlinkov, Mikhail V. and Perrin, Dominique}, biburl = {https://www.bibsonomy.org/bibtex/2434ab104a08e5805e14ee7ffe1755bfe/admin}, ee = {https://doi.org/10.1142/S0129054111008039}, interhash = {244d8ea1bbcde46cd8676ac72fed4462}, intrahash = {434ab104a08e5805e14ee7ffe1755bfe}, journal = {Int. J. Found. Comput. Sci.}, keywords = {}, number = 2, pages = {277-288}, timestamp = {2023-12-12T19:40:24.000+0100}, title = {A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs22.html#BealBP11}, volume = 22, year = 2011 }