{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:12:40Z","timestamp":1767906760926,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01218405","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T16:27:23Z","timestamp":1109348843000},"page":"235-260","source":"Crossref","is-referenced-by-count":6,"title":["On two families of forests"],"prefix":"10.1007","volume":"31","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars: an extension of the context-free case. JACM15, 647?671 (1968)","journal-title":"JACM"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90190-6","volume":"24","author":"A. Alexandrakis","year":"1987","unstructured":"Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene's theorem. Inf. Proc. Lett.24, 1?4 (1987)","journal-title":"Inf. Proc. Lett."},{"key":"CR3","unstructured":"Arnold, A., Dauchet, M.: Une relation d'\u00e9quivalence d\u00e9cidable sur la classe des for\u00eats r\u00e9guli\u00e8res. Publ. Labo Calcul Lille52 (1975)"},{"key":"CR4","first-page":"5","volume":"10","author":"A. Arnold","year":"1976","unstructured":"Arnold, A., Dauchet, M.: Transduction de for\u00eats reconnaissables monadiques. For\u00eats cor\u00e9guli\u00e8res. RAIRO Inf. Th\u00e8or.10, 5?28 (1976)","journal-title":"RAIRO Inf. Th\u00e8or."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02575971","volume":"14","author":"A. Arnold","year":"1977","unstructured":"Arnold, A., Dauchet, M.: Un th\u00e9or\u00e8m de Chomsky-Sch\u00fctzenberger pour les for\u00eats alg\u00e8briques. Calcollo14, 161?184 (1977)","journal-title":"Calcollo"},{"issue":"2","key":"CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(78)90510-7","volume":"34","author":"A. Arnold","year":"1978","unstructured":"Arnold, A., Dauchet, M.: For\u00eats alg\u00e8briques et homomorphisme inverses. Inf. Control34 (2), 182?196 (1978)","journal-title":"Inf. Control"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0019-9958(80)90698-1","volume":"46","author":"A. Arnold","year":"1980","unstructured":"Arnold, A., Leguy, B.: Une propriete des forets algebriques ?de Greibach?. Inf. Control46 (2), 108?134 (1980)","journal-title":"Inf. Control"},{"key":"CR8","volume-title":"Transductions rationnelles","author":"J.M. Autebert","year":"1988","unstructured":"Autebert, J.M., Boasson, L.: Transductions rationnelles. Paris: Masson 1988"},{"key":"CR9","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1978","unstructured":"Berstel, J.: Transductions and context-free languages. Stuttgart: Teubner 1978"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power serieson trees. Theoret. Comput. Sci.18, 15?148 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages (EATCS)","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages (EATCS). Berlin, Heidelberg, New York: Springer 1988"},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1051\/ita\/1989230404491","volume":"23","author":"S. Bozapalidis","year":"1989","unstructured":"Bozapalidis, S., Alexandrakis, A.: Repr\u00e9sentations matricielles des s\u00e9ries d'arbre reconnaissable. Inf. Th\u00e9or. Appl.23 (4), 449?459 (1989)","journal-title":"Inf. Th\u00e9or. Appl."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF01893886","volume":"28","author":"S. Bozapalidis","year":"1991","unstructured":"Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inf.28, 351?363 (1991)","journal-title":"Acta Inf."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(92)90348-J","volume":"99","author":"S. Bozapalidis","year":"1992","unstructured":"Bozapalidis, S.: Alphabetic tree relations. Theoret. Comput. Sci.99, 177?211 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-up, top-down tree transformations: a comparison. Math. Systems Theory9, 198?231 (1975)","journal-title":"Math. Systems Theory"},{"key":"CR16","volume-title":"Tree automata","author":"F. Gecseg","year":"1984","unstructured":"Gecseg, F., Steinby, M.: Tree automata. Budapest: Akademiai Kiado 1984"},{"key":"CR17","volume-title":"Algebraic and automata-theoretic properties of formal languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. Amsterdam, New York, Oxford: North-Holland 1975"},{"key":"CR18","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"Ginsburg, S., Greibach, S.: Abstract families of languages. In: Studies in Abstract Families of Languages. Mem. Am. Math. Soc.87, 1?32 (1969)","journal-title":"Mem. Am. Math. Soc."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Math. Systems Theory16, 237?263 (1983)","journal-title":"Math. Systems Theory"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0022-0000(74)80031-0","volume":"8","author":"T.S.E. Maibaum","year":"1974","unstructured":"Maibaum, T.S.E.: A generalized approach to formal languages. J. Comput. System Sci.8, 409?439 (1974)","journal-title":"J. Comput. System Sci."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory4, 257?287 (1970)","journal-title":"Math. Systems Theory"},{"key":"CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-theoretic aspects of formal power series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Berlin, Heidelberg, New York: Springer 1978"},{"issue":"1","key":"CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory2(1), 57?81 (1968)","journal-title":"Math. Systems Theory"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01218405.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01218405\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01218405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:37:38Z","timestamp":1556617058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01218405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01218405"],"URL":"https:\/\/doi.org\/10.1007\/bf01218405","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}