Modular tree automata
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Bahr_2012_Modular_tree_automata_postprint
Accepted author manuscript, 339 KB, PDF document
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 language | English |
---|---|
Title of host publication | Mathematics of Program Construction : 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings |
Editors | Jeremy Gibbons, Pablo Nogueira |
Number of pages | 37 |
Publisher | Springer |
Publication date | 2012 |
Pages | 263-299 |
ISBN (Print) | 978-3-642-31112-3 |
ISBN (Electronic) | 978-3-642-31113-0 |
DOIs | |
Publication status | Published - 2012 |
Event | 11th International Conference on Mathematics of Program Construction - Madrid, Spain Duration: 25 Jun 2012 → 27 Jun 2012 Conference number: 11 |
Conference
Conference | 11th International Conference on Mathematics of Program Construction |
---|---|
Nummer | 11 |
Land | Spain |
By | Madrid |
Periode | 25/06/2012 → 27/06/2012 |
Series | Lecture notes in computer science |
---|---|
Volume | 7342 |
ISSN | 0302-9743 |
- Faculty of Science - compiler, tree transducer, deforestation, attribute grammar, syntax-directed
Research areas
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 38429487