{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:15Z","timestamp":1760203035137,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_41","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"551-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Synchronizing Words for Real-Time Deterministic Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[]},{"given":"Eitatsu","family":"Mikami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Cauca D (2006) Synchronization of pushdown automata. In: Proceedings of DLT 2006, vol\u00a04036. Springer, pp 120\u2013132","DOI":"10.1007\/11779148_12"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D Eppstein","year":"1990","unstructured":"Eppstein D (1990) Reset sequences for monotonic automata. SIAM J Comput 19:500\u2013510","journal-title":"SIAM J Comput"},{"key":"41_CR3","unstructured":"Fernau H, Wolf P, Yamakami T (2020) Synchronizing deterministic push-down automata can be really hard. In: Proceedings of MFCS 2020, vol\u00a0170, pp 33:1\u201333:15"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/320932.320938","volume":"5","author":"S Ginsburg","year":"1958","unstructured":"Ginsburg S (1958) On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. J ACM 5:266\u2013280","journal-title":"J ACM"},{"key":"41_CR5","unstructured":"Mikami E, Yamakami T (2020) Synchronizing pushdown automata and reset words. Comp2019-54(2020-03), Technical report of the institute of electronics, information and communication engineers (2020). (in Japanese)"},{"key":"41_CR6","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore EF (1956) Gedanken-experiments on sequential machines. Autom Stud Ann Math Stud 34:129\u2013153","journal-title":"Autom Stud Ann Math Stud"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Olschewski J, Ummels M (2010) The complexity of finding reset words in finite automata. In: Proceedings of MFCS 2010, vol\u00a06281. Springer, pp 568\u2013579","DOI":"10.1007\/978-3-642-15155-2_50"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Salomaa A (2002) Synchronization of finite automata: contributions to an old problem. In: Mogensen T\u00c6 et al (ed) The essence of computation, vol\u00a02566. Springer, pp 37\u201359","DOI":"10.1007\/3-540-36377-7_3"},{"key":"41_CR9","first-page":"367","volume":"24","author":"Y Shitov","year":"2019","unstructured":"Shitov Y (2019) An improvement to a recent upper bound for synchronizing words of finite automata. J Aut Lang Comb 24:367\u2013373","journal-title":"J Aut Lang Comb"},{"key":"41_CR10","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd J (1964) Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatami. Matematicko-fyzik\u00e1lny \u010casopis Slovensk. Akad. Vied. 14:208\u2013216 (in Slovak)","journal-title":"Matematicko-fyzik\u00e1lny \u010casopis Slovensk. Akad. Vied."},{"key":"41_CR11","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd J, Pirick\u00e1 A, Rosenauerov\u00e1 B (1971) On directable automata. Kybernetika 7:289\u2013298","journal-title":"Kybernetika"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Volkov MV (2008) Synchronizing automata and the \u010cern\u00fd conjecture. In: Proceedings of LATA 2008, vol\u00a05196. Springer, pp 11\u201327","DOI":"10.1007\/978-3-540-88282-4_4"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:08:35Z","timestamp":1646489315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_41"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_41","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}