In this survey we generalize some results on formal tree languages, tree grammars and tree
automata by an algebraic treatment using semirings, fixed point theory, formal tree series …

Infinite trees naturally arise in the formalization and the study of the semantics of
programming languages. This paper investigates some of their combinatorial and algebraic …

Publisher Summary This chapter presents three mathematical tools that can be used to
describe graph-grammars and the sets generated by them. The chapter describes graph …

The theory of tree automata and tree languages emerged in the middle of the 1960s quite
naturally from the view of finite automata as unary algebras advocated by JR Biichi and JB …

The macro tree transducer can be considered as a system of recursive function procedures
with parameters, where the recursion is on a tree (eg, the syntax tree of a program). We …

We define an algebraic structure for the set of finite graphs, a notion of graph expression for
defining them, and a complete set of equational rules for manipulating graph …

Macro tree transducers are a combination of top-down tree transducers and macro
grammars. They serve as a model for syntax-directed semantics in which context information …

If we take the class of context-free phrase structure grammars (CFPSGs) and modify it so that
(i) grammars are allowed to make use of finite feature systems and (ii) rules are permitted to …

An analysis of recursive procedures in ALGOL 68 with finite modes shows, that a
denotational semantics of this language can be described on the level of program schemes …

The subject of this book is the investigation of tree transducers. Tree trans ducers were
introduced in theoretical computer science in order to study the general properties of formal …