{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:55:37Z","timestamp":1649062537054},"reference-count":9,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1051\/ita:2002002","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T16:23:56Z","timestamp":1068827036000},"page":"5-28","source":"Crossref","is-referenced-by-count":0,"title":["Polypodic codes"],"prefix":"10.1051","volume":"36","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]},{"given":"Olympia","family":"Louscou\u2013Bozapalidou","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2002,12,15]]},"reference":[{"key":"R1","first-page":"508","volume":"5","author":"Bozapalidis","year":"1999","journal-title":"J. Universal Comput. Sci."},{"key":"R2","unstructured":"J. Berstel and D. Perrin,Theory of Codes. Academic Press (1985)."},{"key":"R3","unstructured":"B. Courcelle,Graph rewriting: An Algebraic and Logic Approach, edited by J. van Leeuwen. Elsevier, Amsterdam,Handb. Theoret. Comput. Sci.B(1990) 193-242."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby,Tree Languages, edited by G. Rozenberg and A. Salomaa. Springer-Verlag, New York,Handb. Formal Lang.3, pp. 1-68.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"V. Give'on,Algebraic Theory of m-automata, edited by Z. Kohavi and A. Paz. Academic Press, New York,Theory of Machines and Computation(1971) 275-286.","DOI":"10.1016\/B978-0-12-417750-5.50029-4"},{"key":"R6","unstructured":"J. Engelfriet,Tree Automata and tree Grammars. DAIMI FN-10 (1975)."},{"key":"R7","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01360871","volume":"157","author":"Menger","year":"1964","journal-title":"Math. Ann."},{"key":"R8","unstructured":"S. Mantaci and A. Restivo, Tree Codes and Equations, inProc. of the 3rdInternational Conference DLT'97, edited by S. Bozapalidis. Thessaloniki (1998) 119-132."},{"key":"R9","unstructured":"M. Nivat,Binary Tree Codes. Tree Automata and Languages. Elsevier Science Publishers B.V. North Holland (1992) 1-19."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:01:32Z","timestamp":1585263692000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":9,"journal-issue":{"issue":"1"},"alternative-id":["ita0210"],"URL":"https:\/\/doi.org\/10.1051\/ita:2002002","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}