{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:59Z","timestamp":1725663719756},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557197"},{"type":"electronic","value":"9783540472780"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55719-9_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:33:57Z","timestamp":1330234437000},"page":"150-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On reverse and general definite tree languages"],"prefix":"10.1007","author":[{"given":"Pierre","family":"P\u00e9ladeau","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. B, Academic Press, 1976."},{"volume-title":"Tree Automata","year":"1984","author":"F. G\u00e9csec","key":"13_CR2","unstructured":"F. G\u00e9csec, M. Steinby. Tree Automata. (Akademiai Kiado, Budapest, 1984)."},{"key":"13_CR3","first-page":"137","volume":"35","author":"U. Heuter","year":"1988","unstructured":"U. Heuter, Definite tree languages, Bulletin of the EATCS 35, 1988, 137\u2013142.","journal-title":"Bulletin of the EATCS"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"U. Heuter, Generalized definite tree languages, Proc. 14th MFCS, Lecture Notes in Computer Science 379, Springer, 1989, 270\u2013280.","DOI":"10.1007\/3-540-51486-4_74"},{"volume-title":"Dissertation","year":"1989","author":"U. Heuter","key":"13_CR5","unstructured":"U. Heuter, Zur Klassifizierung regul\u00e4ler Baumsprachen. Dissertation, University of Aachen (1989), Aachen, FRG."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"M. Nivat and A. Podelski, Tree monoids and recognizable sets of trees, in H. A\u00eft-Kaci and M. Nivat eds., Resolution of Equations in Algebraic Structures, Vol. 1, Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046370-1.50016-4"},{"key":"13_CR7","first-page":"186","volume":"38","author":"N. Nivat","year":"1989","unstructured":"N. Nivat and A. Podelski, Definite tree languages (cont'd), Bulletin of the EATCS\n38, 1989, 186\u2013190.","journal-title":"Bulletin of the EATCS"},{"key":"13_CR8","unstructured":"A. Podelski, Mono\u00efdes d'Arbres et Automates d'Arbres, Th\u00e8se de Doctorat, Universit\u00e9 Paris 7, 1989."},{"volume-title":"Vari\u00e9t\u00e9s de langages formels","year":"1984","author":"J. E. Pin","key":"13_CR9","unstructured":"J. E. Pin, Vari\u00e9t\u00e9s de langages formels, Masson, Paris, 1984, and Varieties of Formal Langages, Plenum, London, 1986."},{"key":"13_CR10","unstructured":"M. Steinby, Syntactic algebras and varieties of recognizable sets, in Les arbres en alg\u00e8bre et en programmation, 4i\u00e8me Coll. Lille (Proc. Coll., Lille 1979) Universit\u00e9 de Lille, 226\u2013240."},{"key":"13_CR11","unstructured":"M. Steinby, \u201cA Theory of Tree Language Varieties,\u201d in: Nivat, M., and Podelski, A., eds., Trees, Automata and Languages, Elsevier Publishers, 1991."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Thatcher, J.B. Wright, \u201cGeneralized Finite Automata Theory with an Application to a Decision Problem of Second Order Logic\u201d, Math.Syst. Th.\n2 (1968).","DOI":"10.1007\/BF01691346"},{"key":"13_CR13","unstructured":"W. Thomas, On noncounting tree languages, Grundl. Theor. Informatik (Proc. 1. Intern. Workshop, Paderborn 1982), 234\u2013242."},{"key":"13_CR14","unstructured":"W. Thomas, Logical aspects in the study of tree languages, Proc. Ninth Coll. on Trees in Algebra and in Programming, Cambrige Univ. Press, 1984, 31\u201349."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55719-9_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:05:37Z","timestamp":1578517537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55719-9_71"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557197","9783540472780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-55719-9_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}