On two families of forests

DOI10.1007/BF01218405zbMATH Open0790.68055OpenAlexW2081386906MaRDI QIDQ1323385FDOQ1323385

George Rahonis, Symeon Bozapalidis

Publication date: 2 June 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01218405

zbMATH Keywords

sheavestree-automataalphabetic conealphabetic tree transductionsfamily of forests

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bottom-up and top-down tree transformations— a comparison
• Indexed Grammars—An Extension of Context-Free Grammars
• Mappings and grammars on trees
• Recognizable formal power series on trees
• Alphabetic tree relations
• Pushdown tree automata
• A generalized approach to formal languages
• Studies in abstract families of languages
• Représentations matricielles des séries d'arbre reconnaissables
• Effective construction of the syntactic algebra of a recognizable series on trees
• Weighted grammars and Kleene's theorem
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
• Forêts Algébriques et Homomorphismes Inverses
• Un théorème de Chomsky-Schützenberger pour les forets algébriques

Cited In (2)

• Principal abstract families of weighted tree languages
• Alphabetic and synchronized tree transducers

This page was built for publication: On two families of forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323385)