Results 221 to 230 of about 1,641 (261)

Streaming Tree Automata [PDF]

open access: yesInformation Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Niehren   +2 more
exaly   +5 more sources

Dependency Tree Automata [PDF]

open access: yesLecture Notes in Computer Science, 2009
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true ...
Colin Stirling
exaly   +4 more sources

Tree-stack automata

Mathematical Systems Theory, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wolfgang Golubski, Wolfram-Manfred Lippe
openaire   +3 more sources

Symbolic Tree Automata

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Margus Veanes, Nikolaj Bjorner
exaly   +4 more sources

Randomization in Automata on Infinite Trees [PDF]

open access: yesACM Transactions on Computational Logic, 2014
We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions of the automaton. A branch in a run is accepting if the ω-word obtained by reading
Olivier Serre, Arnaud Carayol
exaly   +5 more sources

Trees, automata, and games

Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals?
Yuri Gurevich, Leo Harrington
openaire   +2 more sources

Fuzzy tree automata

Fuzzy Sets and Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zoltán Ésik, Guangwu Liu
openaire   +3 more sources

From Word Automata to Tree Automata

2008 The 9th International Conference for Young Computer Scientists, 2008
Finite tree automata have now become a live research field both because of its features as a theoretical model of computation and its practical value in the parsing, query and verification of semi-structured data, such as XML. The aim of this work is to create a link between the already well-developed finite state automata over words and the finite ...
openaire   +1 more source

Home - About - Disclaimer - Privacy