Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

DOI10.1007/978-3-540-76336-9_25zbMath1139.68375OpenAlexW2150317858MaRDI QIDQ3503912

Magnus Steinby, Cătălin Ionuţ Tîrnăucă

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_25

zbMATH Keywords

regular tree languagesnatural language processingtree bimorphismssyntax-directed translations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items (3)

Extended Multi Bottom-Up Tree Transducers ⋮ Equational tree transformations ⋮ Extended multi bottom-up tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Morphismes et bimorphismes d'arbres
• Alphabetic tree relations
• A syntax directed compiler for ALGOL 60
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions

This page was built for publication: Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms