{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:09Z","timestamp":1725745269766},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405785"},{"type":"electronic","value":"9783642405792"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40579-2_22","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T06:24:48Z","timestamp":1376461488000},"page":"205-216","source":"Crossref","is-referenced-by-count":1,"title":["Regular Ideal Languages and Synchronizing Automata"],"prefix":"10.1007","author":[{"given":"Rog\u00e9rio","family":"Reis","sequence":"first","affiliation":[]},{"given":"Emanuele","family":"Rodaro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Gusev, V., Maslennikova, M., Pribavkina, E.: Principal ideal languages and synchronizing automata. In: Halava, V., Karhumaki, J., Matiyasevich, Y. (eds.) RuFiDimII. TUCS Lecture Notes, vol.\u00a017 (2012)","key":"22_CR1","DOI":"10.1007\/978-3-642-40579-2_16"},{"key":"22_CR2","series-title":"LNCS","first-page":"143","volume-title":"WORDS 2013","author":"V.V. Gusev","year":"2013","unstructured":"Gusev, V.V., Maslennikova, M.I., Pribavkina, E.V.: Finitely generated ideal languages and synchronizing automata. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol.\u00a08079, pp. 143\u2013153. Springer, Heidelberg (2013)"},{"unstructured":"Maslennikova, M.: Reset complexity of ideal languages. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., \u0160p\u00e1nek, R., Tur\u00e1n, G. (eds.) Proc. Int. Conf. SOFSEM 2012, vol.\u00a0II, pp. 33\u201344. Institute of Computer Science Academy of Sci- ences of the Czech Republic (2012)","key":"22_CR3"},{"key":"22_CR4","first-page":"535","volume":"17","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/978-3-642-00982-2_57","volume-title":"Language and Automata Theory and Applications","author":"E.V. Pribavkina","year":"2009","unstructured":"Pribavkina, E.V., Rodaro, E.: Finitely generated synchronizing automata. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 672\u2013683. Springer, Heidelberg (2009)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-14455-4_34","volume-title":"Developments in Language Theory","author":"E.V. Pribavkina","year":"2010","unstructured":"Pribavkina, E.V., Rodaro, E.: State complexity of prefix, suffix, bifix and infix operators on regular languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 376\u2013386. Springer, Heidelberg (2010)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21875-0_24","volume-title":"Models of Computation in Context","author":"E.V. Pribavkina","year":"2011","unstructured":"Pribavkina, E.V., Rodaro, E.: Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol.\u00a06735, pp. 230\u2013238. Springer, Heidelberg (2011)"},{"issue":"07","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1142\/S0129054111008957","volume":"22","author":"E.V. Pribavkina","year":"2011","unstructured":"Pribavkina, E.V., Rodaro, E.: State complexity of code operators. International Journal of Foundations of Computer Science\u00a022(07), 1669\u20131681 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.ic.2010.11.020","volume":"209","author":"E.V. Pribavkina","year":"2011","unstructured":"Pribavkina, E.V., Rodaro, E.: Synchronizing automata with finitely many minimal synchronizing words. Information and Computation\u00a0209(3), 568\u2013579 (2011), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540110002063","journal-title":"Information and Computation"},{"issue":"1-2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I. Rystsov","year":"1997","unstructured":"Rystsov, I.: Reset words for commutative and solvable automata. Theoretical Computer Science\u00a0172(1-2), 273\u2013279 (1997), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397596001363","journal-title":"Theoretical Computer Science"},{"key":"22_CR11","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Mat.-Fyz. \u010cas. Slovensk. Akad. Vied.\u00a014, 208\u2013216 (1964) (in slovak)","journal-title":"Mat.-Fyz. \u010cas. Slovensk. Akad. Vied."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40579-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T14:00:25Z","timestamp":1646316025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40579-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405785","9783642405792"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40579-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}