Modular tree automata
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Bahr_2012_Modular_tree_automata_postprint
Accepteret manuskript, 339 KB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Titel | Mathematics of Program Construction : 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings |
Redaktører | Jeremy Gibbons, Pablo Nogueira |
Antal sider | 37 |
Forlag | Springer |
Publikationsdato | 2012 |
Sider | 263-299 |
ISBN (Trykt) | 978-3-642-31112-3 |
ISBN (Elektronisk) | 978-3-642-31113-0 |
DOI | |
Status | Udgivet - 2012 |
Begivenhed | 11th International Conference on Mathematics of Program Construction - Madrid, Spanien Varighed: 25 jun. 2012 → 27 jun. 2012 Konferencens nummer: 11 |
Konference
Konference | 11th International Conference on Mathematics of Program Construction |
---|---|
Nummer | 11 |
Land | Spanien |
By | Madrid |
Periode | 25/06/2012 → 27/06/2012 |
Navn | Lecture notes in computer science |
---|---|
Vol/bind | 7342 |
ISSN | 0302-9743 |
- Det Natur- og Biovidenskabelige Fakultet
Forskningsområder
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 38429487