{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:24Z","timestamp":1725662904832},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_92","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:32:46Z","timestamp":1330173166000},"page":"262-270","source":"Crossref","is-referenced-by-count":7,"title":["Combining T and level-N"],"prefix":"10.1007","author":[{"given":"W.","family":"Damm","sequence":"first","affiliation":[]},{"given":"I.","family":"Guessarian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"BILSTEIN, J. \/ DAMM, W. Top-down tree-transducers for infinite trees I, Proc. 6 i\u00e8me colloque sur les Arbres en Alg\u00e9bre et en Programmation, Lecture Notes in Computer Science (1981), to appear","DOI":"10.1007\/3-540-10828-9_58"},{"key":"23_CR2","first-page":"266","volume":"74","author":"W. Damm","year":"1979","unstructured":"DAMM, W. An algebraic extension of the Chomsky-Hierarchy, Proc. conf. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 74 (1979), 266\u2013276, Springer Verlag","journal-title":"Proc. conf. on Mathematical Foundations of Computer Science"},{"key":"23_CR3","unstructured":"DAMM, W. The IO-and OI-hierarchies, Schriften zur Informatik und Angewandten Mathematik 41 (1980), RWTH Aachen, submitted for publication"},{"key":"23_CR4","unstructured":"DAMM, W. Top-down tree-transducers for infinite trees, in preparation"},{"key":"23_CR5","unstructured":"DAMM, W. \/ GOERDT,A. Level-n PDA's, in preparation"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"DAMM, W. \/ GUESSARIAN, I. Combining T and level-N LITP-report 81-11, University Paris VII, (1981)","DOI":"10.1007\/3-540-10856-4_92"},{"key":"23_CR7","unstructured":"ENGELFRIET, J. Tree automata and tree grammars, Datalogisk Afdelning report, DAIMI FN-10, Aarhus University (1975)"},{"key":"23_CR8","unstructured":"ENGELFRIET, J. Three hierarchies of transducers, Memorandum 217 (1978), Twente University of Technology"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"ENGELFRIET, J. Some open questions and recent results on tree transducers and tree languages, Proc. Symposium on Formal Language Theory, Academic Press (1980), to appear","DOI":"10.1016\/B978-0-12-115350-2.50014-2"},{"issue":"3","key":"23_CR10","first-page":"328","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"ENGELFRIET, J. \/ SCHMIDT, E.M. IO and OI, JCSS Vol. 15, 3 (1977), 328\u2013353 and Vol. 16, 1 (1978), 67\u201399","journal-title":"JCSS"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"GUESSARIAN, I. On pushdown tree automata, Proc. 6 i\u00e8me colloque sur les Arbres en Alg\u00e9bre et en Programmation, Lecture Notes in Computer Science (1981), to appear","DOI":"10.1007\/3-540-10284-1"},{"issue":"1","key":"23_CR12","first-page":"55","volume":"12","author":"A.N. Maslov","year":"1976","unstructured":"MASLOV, A.N. Multilevel stack automata, Problemy Peredachi Informatsii Vol. 12, 1 (1976), 55\u201362","journal-title":"Problemy Peredachi Informatsii"},{"key":"23_CR13","unstructured":"VOGLER, H. Berechnungsmodelle syntaxgesteuerter \u00dcbersetzungen, Diplomarbeit, RWTH Aachen (1981),to appear"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-07142-3_84","volume":"25","author":"M. Wand","year":"1975","unstructured":"WAND, M. An algebraic formulation of the Chomsky-Hierarchy Category Theory Applied to Computation and Control, Lecture Notes in Computer Science 25 (1975), 209\u2013213","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:04:07Z","timestamp":1605625447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}