{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T09:10:39Z","timestamp":1774775439883,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583387","type":"print"},{"value":"9783540486633","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_97","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:51:23Z","timestamp":1330253483000},"page":"504-514","source":"Crossref","is-referenced-by-count":2,"title":["On the minimization problem for \u03c9-automata"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Sa\u00ebc","sequence":"first","affiliation":[]},{"given":"Igor","family":"Litovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"43_CR1","unstructured":"Do Long Van, B. Le Sa\u00ebc, I. Litovsky, \u201cA Syntactic Approach To Deterministic \u03c9-Automata\u201d, in Th\u00e9orie des Automates et Applications (D. Krob ed.) Actes des Deuxi\u00e8mes Journ\u00e9es Franco-Belges. Rouen (1991) 133\u2013146."},{"key":"43_CR2","volume-title":"Automata, Languages And Machines\u201d Vol.A (1974) and Vol.B","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg \u201cAutomata, Languages And Machines\u201d Vol.A (1974) and Vol.B (1976) Accademic Press New York."},{"key":"43_CR3","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1051\/ita\/1990240605451","volume":"24","author":"B. Sa\u00ebc Le","year":"1990","unstructured":"B. Le Sa\u00ebc \u201cSaturating Right Congruences for Rational \u03c9-Languages\u201d R.A.I.R.O. Inform. Theor. Appl. 24 (1990) 545\u2013560.","journal-title":"R.A.I.R.O. Inform. Theor. Appl."},{"issue":"N\u22183","key":"43_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1142\/S0218196791000195","volume":"1","author":"B. Sa\u00ebc Le","year":"1991","unstructured":"B. Le Sa\u00ebc, J.E. Pin, P. Weil, \u201cFinite semigroup whose stabilizers are idempotent\u201d, International Journal of Algebra and Computation, Vol 1, N\u22183 (1991) 291\u2013314.","journal-title":"International Journal of Algebra and Computation"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"O. Maler, L. Staiger \u201cOn Syntactic Congruences For \u03c9-languages\u201d STACS'93, LNCS vol. 665, To appear.","DOI":"10.1016\/S0304-3975(96)00312-X"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton \u201cTesting And Generating Infinite Sequences By Finite Automaton.\u201d Inform. Control 9, (1966) 521\u201330.","journal-title":"Inform. Control"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"D. M\u00fcller \u201cInfinite Sequences And Finite Machines\u201d Switching Theory and Logical Design, (Proc. 4th IEEE Symp.), (1963) 3\u201316.","DOI":"10.1109\/SWCT.1963.8"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"S. Safra \u201cOn The Complexity Of \u03c9-Automata\u201d 29th Annual Symposium on Foundation of computer sciences, (1988) 24\u201329.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L. Staiger","year":"1983","unstructured":"L. Staiger \u201cFinite-state \u03c9-languages\u201d J. Computation. Sys. Sci. 27, (1983) 434\u2013448.","journal-title":"J. Computation. Sys. Sci."},{"issue":"1","key":"43_CR10","first-page":"103","volume":"3","author":"A. Trachenbrot","year":"1962","unstructured":"A. Trachenbrot \u201cFinite Automata And The Logic Of One-Place Predicates\u201d Siberian Math. J. 3(1) (1962) 103\u2013131.","journal-title":"Siberian Math. J."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:53Z","timestamp":1605629993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}