{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T05:37:02Z","timestamp":1776231422685,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540763352","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_5","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T01:44:48Z","timestamp":1193449488000},"page":"27-37","source":"Crossref","is-referenced-by-count":6,"title":["Synchronizing Automata Preserving a Chain of Partial Orders"],"prefix":"10.1007","author":[{"given":"Mikhail V.","family":"Volkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/11505877_10","volume-title":"Developments in Language Theory","author":"D.S. Ananichev","year":"2005","unstructured":"Ananichev, D.S.: The mortality threshold for partially monotonic automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 112\u2013121. Springer, Heidelberg (2005)"},{"key":"5_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":"5_CR3","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. Cas. Slovensk. Akad. Vied.\u00a014, 208\u2013216 (1964) (in Slovak)","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"5_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":"5_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P. Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb.\u00a03, 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01891840","volume":"10","author":"K. Goldberg","year":"1993","unstructured":"Goldberg, K.: Orienting polygonal parts without sensors. Algorithmica\u00a010, 201\u2013225 (1993)","journal-title":"Algorithmica"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218196795000185","volume":"5","author":"P. Goral\u010dik","year":"1995","unstructured":"Goral\u010dik, P., Koubek, V.: Rank problems for composite transformations. Algebra and Computation\u00a05, 309\u2013316 (1995)","journal-title":"Algebra and Computation"},{"key":"5_CR8","first-page":"134","volume":"68","author":"A. Mateescu","year":"1999","unstructured":"Mateescu, A., Salomaa, A.: Many-valued truth functions, \u010cern\u00fd\u2019s conjecture and road coloring. EATCS Bull.\u00a068, 134\u2013150 (1999)","journal-title":"EATCS Bull."},{"key":"5_CR9","volume-title":"Counter-free automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.A.: Counter-free automata. MIT Press, Cambridge (1971)"},{"key":"5_CR10","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":"5_CR11","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":"5_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(01)00227-4","volume":"292","author":"A. Salomaa","year":"2003","unstructured":"Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci.\u00a0292, 263\u2013281 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2005","unstructured":"Sandberg, S.: 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.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"issue":"2","key":"5_CR14","first-page":"3","volume":"9","author":"A.N. Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete Math. Theoret. Comp. Sci.\u00a09(2), 3\u201310 (2007)","journal-title":"Discrete Math. Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:16Z","timestamp":1619506096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_5","relation":{},"subject":[]}}