Results 11 to 20 of about 1,641 (261)
Hybrid tree automata and the yield theorem for constituent tree automata
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Drewes, Frank +2 more
openaire +4 more sources
Tree Automata and Automata on Linear Orderings [PDF]
Summary: We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second-order theory of the infinite binary tree.
Bruyère, Véronique +2 more
openaire +2 more sources
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +1 more source
Pushing for weighted tree automata [PDF]
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful ...
Thomas Hanneforth +2 more
doaj +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source
Topological properties of cellular automata on trees [PDF]
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity ...
Gabriele Fici, Francesca Fiorenzi
doaj +1 more source
Interpolant Tree Automata and their Application in Horn Clause Verification [PDF]
This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification.
Bishoksan Kafle, John P. Gallagher
doaj +1 more source
From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata [PDF]
In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions.
Nir Piterman
doaj +1 more source
Synthesizing Structured Reactive Programs via Deterministic Tree Automata [PDF]
Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can be a more ...
Benedikt Brütsch
doaj +1 more source
This is a reissue of the book Tree Automata by F. Gécseg and M. Steinby originally published in 1984 by Akadémiai Kiadó, 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.
Ferenc Gécseg, Magnus Steinby
openaire +3 more sources

