{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:14Z","timestamp":1725663254772},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:01:19Z","timestamp":1330185679000},"page":"372-383","source":"Crossref","is-referenced-by-count":0,"title":["Representation of recursively enumerable languages using alternating finite tree recognizers"],"prefix":"10.1007","author":[{"given":"Kai","family":"Salomaa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach.\n28 (1981) 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"36_CR2","unstructured":"F. G\u00e9cseg and M. Steinby, Tree automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"36_CR3","unstructured":"J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979."},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R. E. Ladner","year":"1984","unstructured":"R. E. Ladner, R. J. Lipton and L. J. Stockmeyer, Alternating pushdown and stack automata, SIAM J. Comput.\n13 (1984) 135\u2013155.","journal-title":"SIAM J. Comput."},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-16761-7_77","volume":"226","author":"D. E. Muller","year":"1986","unstructured":"D. E. Muller, A. Saoudi and P. E. Schupp, Alternating automata, the weak monadic theory of the tree, and its complexity, Proc. of 13th ICALP, Lect. Notes Comput. Sci. 226 (1986) 275\u2013283.","journal-title":"Proc. of 13th ICALP, Lect. Notes Comput. Sci."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D. E. Muller","year":"1987","unstructured":"D. E. Muller and P. E. Schupp, Alternating automata on infinite trees, Theoret. Comput. Sci.\n54 (1987) 267\u2013276.","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR7","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal languages, Academic Press, New York, 1973."},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BFb0022666","volume":"214","author":"K. Salomaa","year":"1986","unstructured":"K. Salomaa, Alternating bottom-up tree recognizers, Proc. of 11th CAAP, Lect. Notes Comput. Sci. 214 (1986) 158\u2013171.","journal-title":"Proc. of 11th CAAP, Lect. Notes Comput. Sci."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1988220303191","volume":"22","author":"K. Salomaa","year":"1988","unstructured":"K. Salomaa, Yield-languages recognized by alternating tree recognizers, RAIRO Inform. Th\u00e9or.\n22 (1988) 319\u2013339.","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"36_CR10","unstructured":"K. Salomaa, Alternating tree pushdown automata, Ann. Univ. Turku Ser. AI 192 (1988)."},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-12727-5_25","volume":"159","author":"G. Slutzki","year":"1983","unstructured":"G. Slutzki, Alternating tree automata, Proc. of 8th CAAP, Lect. Notes Comput. Sci. 159 (1983) 392\u2013404.","journal-title":"Proc. of 8th CAAP, Lect. Notes Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:03:39Z","timestamp":1619557419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}