We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up tree series transducer and top-down tree series transducer, respectively, by allowing formal tree series as output rather than trees, where a formal tree series is a mapping from output trees to some semiring. We associate two semantics with a tree series transducer: a mapping which transforms tre...

Extended top-down tree transducers (transducteurs g en eralis es descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press. 1976]) received renewed interest in the eld of Natural Language Processing. Here those transducers are extensively and systematically studied. Their main properties are identi ed and their relation to classical top-down tree transducers...

The tree width of an alternating finite automaton (AFA) measures the parallelism in all computations AFA on a given input. maximal existential (respectively, universal) A string w number choices parallel universal branches) one computation w. We give polynomial time algorithms deciding finiteness AFA’s and width. Also we algorithm that for with decides whether or not is finite. Finiteness decid...

We present a novel approach which facilitates formal verification of component-based software application families using model checking. This approach enables effective compositional reasoning by facilitating formulation of component properties and their environment assumptions. This approach integrates bottom-up component verification and top-down system verification based on the concept of ap...

Abstract We show the decidability of finite sequentiality problem for unambiguous max-plus tree automata. A automaton is called if there at most one accepting run on every tree. The asks whether a given automaton, exist finitely many deterministic automata whose pointwise maximum equivalent to automaton.

CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel composition which is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an ed...