{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:32Z","timestamp":1725567092169},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265467"},{"type":"electronic","value":"9783540316824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11505877_10","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T13:40:25Z","timestamp":1285508425000},"page":"112-121","source":"Crossref","is-referenced-by-count":3,"title":["The Mortality Threshold for Partially Monotonic Automata"],"prefix":"10.1007","author":[{"given":"Dmitry S.","family":"Ananichev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","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.V.: Synchronizing monotonic automata. Theoret. Comput. Sci.\u00a0327, 225\u2013239 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"D.S. Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci.\u00a0330, 3\u201313 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR3","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s konecn\u00fdmi automatami, Mat.- Fyz. Cas. Slovensk. Akad. Vied\u00a014, 208\u2013216 (1964) (in Slovak)","journal-title":"Slovensk. Akad. Vied"},{"key":"10_CR4","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. Comput.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"10_CR5","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. Theoret. Comput. Sci.\u00a0172, 273\u2013279 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control\u00a08, 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"10_CR7","unstructured":"Trahtman, N.: \u010cern\u00fd conjecture for DFA accepting star-free languages (submitted)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11505877_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T01:26:02Z","timestamp":1553131562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11505877_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265467","9783540316824"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11505877_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}