Tree Automata and Tree Grammars

Lecture notes on tree language theory, in particular recognizable tree languages and finite state tree transformations.Comment: 76 pages, slightly revised version of lecture notes from 197

Tree Automata

This is a reissue of the book Tree Automata by F. G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified. Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references

Specifying Data Objects with Initial Algebras

This study presents a systematic approach to specifying data objects with the help of initial algebras. The primary aim is to describe the set-up to be found in modern functional programming languages such as Haskell and ML, although it can also be applied to more general situations.Comment: 120 page

Computing with Equations

The intention of these notes is to give a mathematical account of how I believe students could be taught to think about functional programming languages and to explain how such languages work.Comment: 240 page