{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:34:00Z","timestamp":1725482040017},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646945"},{"type":"electronic","value":"9783540691044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0031385","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:38:17Z","timestamp":1134286697000},"page":"109-121","source":"Crossref","is-referenced-by-count":0,"title":["Minimal separating sets for Muller automata"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Lescow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"V\u00f6ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,29]]},"reference":[{"key":"10_CR1","unstructured":"M. Ackermann, W. Thomas, S. Ulbrand, and J. V\u00f6ge. Report on the Program omega. to appear, 1997."},{"key":"10_CR2","volume-title":"Computers and Intractability, A guide to the theorey of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability, A guide to the theorey of NP-Completeness. Freeman, New York, 1979."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103, New York, 1972. Plenum Press."},{"key":"10_CR4","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. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521\u2013530, 1966.","journal-title":"Information and Control"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite games played on finite graphs. Ann. Pure Appl Logic, 65:149\u2013184, 1993.","journal-title":"Ann. Pure Appl Logic"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"D. E. Muller. Infinite sequences on finite machines. In Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical Design, pages 3\u201316, 1963.","DOI":"10.1109\/SWCT.1963.8"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. On the synthesis of strategies in infinite games. In STACS 95, volume 900 of Lect. Notes in Comput. Sci., pages 1\u201313. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_57"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:51:45Z","timestamp":1586613105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646945","9783540691044"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0031385","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}