{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:59Z","timestamp":1725577439855},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_9","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"79-86","source":"Crossref","is-referenced-by-count":4,"title":["COMPAS - A Computing Package for Synchronization"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Chmiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","volume":"387","author":"M. Almeida","year":"2007","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comp. Sci.\u00a0387(2), 93\u2013102 (2007)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2004.03.068","volume":"327","author":"D.S. Ananichev","year":"2004","unstructured":"Ananichev, D.S., Volkov, M.: Synchronizing monotonic automata. Theor. Comp. Sci.\u00a0327(3), 225\u2013239 (2004)","journal-title":"Theor. Comp. Sci."},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comp. Sci.\u00a0376(1-2), 30\u201341 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR4","unstructured":"boost library, http:\/\/www.boost.org"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","volume":"12","author":"J.M. Camparnaud","year":"1991","unstructured":"Camparnaud, J.M., Hansel, G.: Automate, a computing package for automata and finite semigroups. J. Symb. Comput.\u00a012, 197\u2013220 (1991)","journal-title":"J. Symb. Comput."},{"key":"9_CR6","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k komog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Mat. fyz. \u010das. SAV\u00a014, 208\u2013215 (1964)","journal-title":"Mat. fyz. \u010das. SAV"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Inf. Theor. Appl.\u00a032, 21\u201334 (1998)","journal-title":"RAIRO Inf. Theor. Appl."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D. Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comp.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comp."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Froidure, V., Pin, J.E.: Algorithms for computing finite semigroups. Foundations of Comp. Math., 112\u2013126 (1997)","DOI":"10.1007\/978-3-642-60539-0_9"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02573120","volume":"37","author":"P.M. Higgins","year":"1988","unstructured":"Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum\u00a037, 31\u201336 (1988)","journal-title":"Semigroup Forum"},{"key":"9_CR11","first-page":"146","volume":"73","author":"J. Kari","year":"2001","unstructured":"Kari, J.: A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata. Bull. EATCS\u00a073, 146 (2001)","journal-title":"Bull. EATCS"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44683-4_38","volume-title":"Mathematical Foundations of Computer Science 2001","author":"J. Kari","year":"2001","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 432\u2013438. Springer, Heidelberg (2001)"},{"key":"9_CR13","unstructured":"Kari, J.: Synchronization and Stability of Finite Automata. J. Universal Comp. Sci.\u00a08(2), 270\u2013277"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01071771","volume":"23","author":"A.A. Klyachko","year":"1987","unstructured":"Klyachko, A.A., Rystsov, I.C., Spivak, M.A.: An extremal combinatorial problem associated with the bound of the length of a synchronizing word in an automaton. Cybernetics\u00a023, 165\u2013171 (1987)","journal-title":"Cybernetics"},{"issue":"1-2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2004.07.007","volume":"328","author":"S. Lombardy","year":"2004","unstructured":"Lombardy, S., R\u00e9gis-Gianas, Y., Sakarovitch, J.: Introducing VAUCANSON. Theor. Comp. Sci.\u00a0328(1-2), 77\u201396 (2004)","journal-title":"Theor. Comp. Sci."},{"issue":"9-10","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.ic.2008.03.020","volume":"206","author":"P.V. Martjugin","year":"2008","unstructured":"Martjugin, P.V.: A series of slowly synchronizing automata with a zero state over a small alphabet. Inform. and Comput.\u00a0206(9-10), 1197\u20131203 (2008)","journal-title":"Inform. and Comput."},{"key":"9_CR17","first-page":"132","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"B.K. Natarajan","year":"1986","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: 27th Annual Symposium on Foundations of Computer Science, pp. 132\u2013142. IEEE, Los Alamitos (1986)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-08860-1_25","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1978","unstructured":"Pin, J.-E.: Sur un cas pariculier de la conjecture de \u010cern\u00fd. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 345\u2013352. Springer, Heidelberg (1978)"},{"key":"9_CR19","first-page":"535","volume":"17","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. of Discr. Math.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. of Discr. Math."},{"issue":"2","key":"9_CR20","first-page":"141","volume":"13","author":"A. Roman","year":"2008","unstructured":"Roman, A.: A Note on \u010cern\u00fd Conjecture for Automata over 3-Letter Alphabet. J. Aut. Lang. and Comb.\u00a013(2), 141\u2013143 (2008)","journal-title":"J. Aut. Lang. and Comb."},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.amc.2008.06.019","volume":"209","author":"A. Roman","year":"2009","unstructured":"Roman, A.: Synchronizing finite automata with short reset words. Appl. Math. Comp.\u00a0209(1), 125\u2013136 (2009)","journal-title":"Appl. Math. Comp."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-00982-2_58","volume-title":"Language and Automata Theory and Applications","author":"A. Roman","year":"2009","unstructured":"Roman, A.: Genetic Algorithm for Synchronization. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 684\u2013695. Springer, Heidelberg (2009)"},{"key":"9_CR23","unstructured":"Samotij, W.: A note on the complexity of the problem of finding shortest synchronizing words. In: Proc. AutoMathA 2007, Automata: from Mathematics to Applications, Univ. Palermo, CD (2007)"},{"key":"9_CR24","unstructured":"Skvortsov, E., Zaks, Y.: Synchronizing Random Automata. In: AutoMathA 2009 Conference, to be published in Discr. Math. and Theor. Comp. Sci. (2009)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-44977-9_22","volume-title":"Implementation and Application of Automata","author":"A.N. Trahtman","year":"2003","unstructured":"Trahtman, A.N.: A Package TESTAS for Checking Some Kinds of Testability. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 228\u2013232. Springer, Heidelberg (2003)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/11821069_68","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A.N. Trahtman","year":"2006","unstructured":"Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the \u010cern\u00fd conjecture. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 789\u2013800. Springer, Heidelberg (2006)"},{"key":"9_CR27","unstructured":"Volkov, M.: Synchronizing automata and the Road Coloring Theorem. In: A Tutorial on a Satellite Workshop to CSR 2008 \u201dWorkshop on Algebra, Combinatorics and Complexity\u201d, Moscow 2008 (2008)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:18:40Z","timestamp":1559989120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}