{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:25Z","timestamp":1725888985189},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_21","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"262-273","source":"Crossref","is-referenced-by-count":0,"title":["Reset Complexity of Ideal Languages Over a Binary Alphabet"],"prefix":"10.1007","author":[{"given":"Marina","family":"Maslennikova","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15155-2_7","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D Ananichev","year":"2010","unstructured":"Ananichev, D., Gusev, V., Volkov, M.: Slowly synchronizing automata and digraphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55\u201365. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-15155-2_7"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266. IEEE, New York (1977). doi:\n10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00224-013-9516-6","volume":"54","author":"P Martygin","year":"2014","unstructured":"Martygin, P.: Computational complexity of certain problems related to carefuuly synchronizing words for partial automata and directing words for nondeterministic automata. Theory Comput. Sci. 54(2), 293\u2013304 (2014). doi:\n10.1007\/s00224-013-9516-6\n\n. In: Ablayev, F. (ed.), Springer","journal-title":"Theory Comput. Sci."},{"key":"21_CR4","unstructured":"Maslennikova, M.I.: Reset complexity of ideal languages. In: Bielikov\u00e1, M. (ed.) International Conference on SOFSEM 2012, vol. II, pp. 33\u201344. Institute of Computer Science Academy of Sciences of the Czech Republic (2012). \narXiv:1404.2816"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-09704-6_27","volume-title":"Descriptional Complexity of Formal Systems","author":"M Maslennikova","year":"2014","unstructured":"Maslennikova, M.: Complexity of checking whether two automata are synchronized by the same language. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 306\u2013317. Springer, Cham (2014). doi:\n10.1007\/978-3-319-09704-6_27"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Meyer, A.R., Michael, J.F.: Economy of description by automata, grammars, and formal systems. In: 12th Annual Symposium on Switching and Automata Theory, pp. 188\u2013191. IEEE, New York (1971). doi:\n10.1109\/SWAT.1971.11","DOI":"10.1109\/SWAT.1971.11"},{"issue":"10","key":"21_CR7","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"C\u201320","author":"FR Moore","year":"1971","unstructured":"Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. C\u201320(10), 1211\u20131214 (1971). IEEE, New York","journal-title":"IEEE Trans. Comput."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/b137241","volume-title":"Model-Based Testing of Reactive Systems","author":"S Sandberg","year":"2005","unstructured":"Sandberg, S.: 1 homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5\u201333. Springer, Heidelberg (2005). doi:\n10.1007\/b137241"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Aho, A.V. (ed.) Proceedings of the 5th Annual ACM Symposium on Theory of Computing STOC 1973, pp. 1\u20139. ACM, New York (1973). doi:\n10.1145\/800125.804029","DOI":"10.1145\/800125.804029"},{"key":"21_CR10","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":"MV 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. 5196, pp. 11\u201327. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-88282-4_4"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:03:45Z","timestamp":1496401425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}