{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:39Z","timestamp":1725663579239},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:33Z","timestamp":1330207353000},"page":"214-224","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchies over the context-free languages"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Reinhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"J. Berstel: Transductions and Context-Free Languages, Teubner 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"A.K. Chandra, D.C. Kozen, L.J. Stockmeyer; Alternation, Journ. of the ACM 28,1(1981), 114\u2013133.","journal-title":"Journ. of the ACM"},{"issue":"1","key":"18_CR3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S.A. Cook","year":"1971","unstructured":"S.A. Cook: Characterizations of pushdown machines in terms of timebounded computers, Journ. of the ACM 18,1(1971), 4\u201318","journal-title":"Journ. of the ACM"},{"key":"18_CR4","volume-title":"Introduction to Automata Theory","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979."},{"issue":"5","key":"18_CR5","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"15","author":"N. Immerman","year":"1988","unstructured":"N. Immerman: Nondeterministic space is closed under complementation, SIAM Journ. Comput. 15, 5 (1988), 935\u2013938.","journal-title":"SIAM Journ. Comput."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Birgit Jenner, Bernd Kirsig: Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata. Theoretical Informatics and Applications, 1989, 87\u201399.","DOI":"10.1051\/ita\/1989230100871"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"A.J. Korenjak, J.E. Hopcroft: Simple deterministic languages, Conf. Rec. 7th Annual IEEE Symp. Switching and Automata Theory (1966), 36\u201346.","DOI":"10.1109\/SWAT.1966.22"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0019-9958(84)80029-7","volume":"62","author":"R.E. Ladner","year":"1984","unstructured":"R.E. Ladner,L.J. Stockmeyer,R.J. Lipton: Alternation bounded auxiliary pushdown automata, Information and Control 62(1984), 93\u2013108.","journal-title":"Information and Control"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(89)90023-6","volume":"67","author":"E. Moriya","year":"1989","unstructured":"Etsuro Moriya: A grammatical characterization of alternating pushdown automata, TCS 67 (1989) 75\u201385.","journal-title":"TCS"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R. Szelepcsenyi","year":"1988","unstructured":"R. Szelepcsenyi: The Method of forced enumeration for nondeterministic automata, Acta Informatica 26(1988), 279\u2013284.","journal-title":"Acta Informatica"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Robert I. Soare: Recursively Enumerable Sets and Degrees, Springer 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"L.J. Stockmeyer: The polynomial-time hierarchy, Theoret. Comp. Sci. 3 (1976), 1\u201322.","journal-title":"Theoret. Comp. Sci."},{"issue":"3","key":"18_CR13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I.H. Sudborough","year":"1978","unstructured":"I.H. Sudborough: On the tape complexity of deterministic context-free languages, Journ. of the ACM 25, 3 (1978),405\u2013414.","journal-title":"Journ. of the ACM"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"C. Wrathall: Complete sets and the polynomial-time hierarchy, Theoret. Comp. Sci. 3 (1976), 23\u201333.","journal-title":"Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:49:56Z","timestamp":1605646196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}