{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:02:35Z","timestamp":1710244955716},"reference-count":16,"publisher":"Informa UK Limited","issue":"1-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1080\/00207169008803893","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:16:51Z","timestamp":1182817011000},"page":"117-132","source":"Crossref","is-referenced-by-count":42,"title":["Constructions for alternating finite automata\u2217<\/sup>"],"prefix":"10.1080","volume":"35","author":[{"given":"A.","family":"Fellah","sequence":"first","affiliation":[]},{"given":"H.","family":"J\u00fcrgensen","sequence":"additional","affiliation":[]},{"given":"S.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","unstructured":"Chandra A. K. Kozen D. C. Stockmeyer L. J. IBM T. J. Watson Research Center Yorktown Heights, NY 1978 Alternation. Res. Rept. R7489"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90085-8"},{"key":"CIT0004","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J.E.","year":"1979"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90100-0"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90063-7"},{"key":"CIT0007","unstructured":"Inoue, K., Takanami, I. and Tanaguchi, H. Two-dimensional alternating turing machines. Proc. 14th Ann. ACM Symp. pp.37\u201346. New York: ACM. On Theory of Computing"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90098-9"},{"key":"CIT0009","volume-title":"Restricted Forms of Alternation","author":"King K.N.","year":"1980"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90170-2"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Ladner, R.E., Lipton, R.J and Stockmeyer, L.J. 1978. Alternating pushdown automata. Proc. 19th IEEE Symp. 1978. pp.92\u2013106. on Foundations of Computer Science, IEEE","DOI":"10.1109\/SFCS.1978.6"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264255"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90036-7"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Sudborough, I.H. 1980. Efficient algorithms for path system problems and applications to alternating and time-space complexity classes. Proc 21st IEEE Ann. Symp. 1980. pp.62\u201372. On Foundations of Computer Science, IEEE","DOI":"10.1109\/SFCS.1980.17"},{"key":"CIT0015","volume-title":"Computational Complexity","author":"Wagner K.","year":"1986"},{"key":"CIT0016","volume-title":"Theory of Computation","author":"Wood D.","year":"1987"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169008803893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T19:49:32Z","timestamp":1556567372000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169008803893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":16,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1080\/00207169008803893"],"URL":"https:\/\/doi.org\/10.1080\/00207169008803893","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}