{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:19:31Z","timestamp":1649017171871},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0304-3975(99)00016-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"47-57","source":"Crossref","is-referenced-by-count":0,"title":["Minimal separating sets for acceptance conditions in Muller Automata"],"prefix":"10.1016","volume":"231","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":"78","reference":[{"key":"10.1016\/S0304-3975(99)00016-X_BIB1","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, A guide to the Theorey of NP-Completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0304-3975(99)00016-X_BIB2","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0304-3975(99)00016-X_BIB3","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00016-X_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","article-title":"Infinite games played on finite graphs","volume":"65","author":"McNaughton","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(99)00016-X_BIB5","doi-asserted-by":"crossref","unstructured":"D.E. Muller, Infinite sequences on finite machines, Proc. 4th IEEE Symposium on Switching Circuit Theory and Logical Design, 1963, pp. 3\u201316.","DOI":"10.1109\/SWCT.1963.8"},{"key":"10.1016\/S0304-3975(99)00016-X_BIB6","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas, On the synthesis of strategies in infinite games, in: STACS 95, Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 1\u201313.","DOI":"10.1007\/3-540-59042-0_57"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:22:35Z","timestamp":1555420955000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S030439759900016X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00016-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}