{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:33:37Z","timestamp":1720200817919},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"vor","delay-in-days":1487,"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":[[2012,1]]},"DOI":"10.1016\/j.tcs.2011.10.012","type":"journal-article","created":{"date-parts":[[2011,10,31]],"date-time":"2011-10-31T06:38:52Z","timestamp":1320043132000},"page":"17-32","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["On M\u00fcller context-free grammars"],"prefix":"10.1016","volume":"416","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.10.012_br000005","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","article-title":"Finite automata and ordinals","volume":"156","author":"Bedon","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2011.10.012_br000010","series-title":"DLT\u20192005","first-page":"158","article-title":"A Kleene theorem for languages of words indexed by linear orderings","volume":"vol. 3572","author":"B\u00e8s","year":"2005"},{"key":"10.1016\/j.tcs.2011.10.012_br000015","first-page":"1","article-title":"Deciding whether the frontier of a regular tree is scattered","volume":"55","author":"Bloom","year":"2003","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2011.10.012_br000020","series-title":"Theoretical Computer Science (Fourth GI Conf., Aachen, 1979)","first-page":"1","article-title":"Context-free sets of infinite words","volume":"vol. 67","author":"Boasson","year":"1979"},{"key":"10.1016\/j.tcs.2011.10.012_br000025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","article-title":"Automata on linear orderings","volume":"73","author":"Bruy\u00e8re","year":"2007","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2011.10.012_br000030","series-title":"Decidable Theories, II","first-page":"1","article-title":"The monadic second order theory of \u03c91","volume":"vol. 328","author":"B\u00fcchi","year":"1973"},{"issue":"1","key":"10.1016\/j.tcs.2011.10.012_br000035","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","article-title":"Finite automata, definable sets, and regular expressions over \u03c9n-tapes","volume":"17","author":"Choueka","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2011.10.012_br000040","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","article-title":"Theory of \u03c9-languages, parts one and two","volume":"15","author":"Cohen","year":"1977","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2011.10.012_br000045","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1978120403191","article-title":"Frontiers of infinite trees","volume":"12","author":"Courcelle","year":"1978","journal-title":"RAIRO Theor. Inf."},{"key":"10.1016\/j.tcs.2011.10.012_br000050","series-title":"ICTAC 2009","first-page":"185","article-title":"Context-free languages of countable words","volume":"vol. 5684","author":"\u00c9sik","year":"2009"},{"key":"10.1016\/j.tcs.2011.10.012_br000055","unstructured":"F. G\u00e9cseg, M. Steinby, Tree automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"10.1016\/j.tcs.2011.10.012_br000060","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ita\/1980140201311","article-title":"An algorithm for the solution of fixed-point equations for infinite words","volume":"14","author":"Heilbrunner","year":"1980","journal-title":"RAIRO Theor. Inf."},{"key":"10.1016\/j.tcs.2011.10.012_br000065","series-title":"Proc. of Mathematical Foundations of Computer Science (MFCS) 2005","first-page":"495","article-title":"Complexity bounds for regular games","volume":"vol. 3618","author":"Hunter","year":"2005"},{"issue":"1","key":"10.1016\/j.tcs.2011.10.012_br000070","doi-asserted-by":"crossref","first-page":"71","DOI":"10.2178\/bsl\/1174668219","article-title":"On the equimorphism types of linear orderings","volume":"13","author":"Montalb\u00e1n","year":"2007","journal-title":"Bull. Symbolic Logic"},{"issue":"3","key":"10.1016\/j.tcs.2011.10.012_br000075","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","article-title":"Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"12","author":"Nivat","year":"1978","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/j.tcs.2011.10.012_br000080","series-title":"Linear Orderings","author":"Rosenstein","year":"1982"},{"key":"10.1016\/j.tcs.2011.10.012_br000085","first-page":"191","article-title":"Classes of transfinite sequences accepted by finite automata","volume":"7","author":"Wojciechowski","year":"1984","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2011.10.012_br000090","first-page":"379","article-title":"Finite automata on transfinite sequences and regular expressions","volume":"8","author":"Wojciechowski","year":"1985","journal-title":"Fund. Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511008826?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511008826?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T21:30:15Z","timestamp":1543440615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511008826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":18,"alternative-id":["S0304397511008826"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.10.012","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}