Modular Tree Automata

Research output: Conference Article in Proceeding or Book/Report chapterBook chapterResearchpeer-review

Abstract

Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.
Original languageUndefined/Unknown
Title of host publicationMathematics of Program Construction
EditorsJeremy Gibbons, Pablo Nogueira
Number of pages37
Volume7342
PublisherSpringer Berlin Heidelberg
Publication date1 Jun 2012
Pages263-299
ISBN (Print)978-3-642-31112-3
DOIs
Publication statusPublished - 1 Jun 2012

Cite this