Sciweavers

Share
20 search results - page 1 / 4
» Complexity of weak acceptance conditions in tree automata
Sort
View
IPL
2002
117views more  IPL 2002»
8 years 8 months ago
Complexity of weak acceptance conditions in tree automata
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
Jakub Neumann, Andrzej Szepietowski, Igor Walukiew...
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
9 years 2 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
DLT
2003
8 years 9 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
FCT
2007
Springer
9 years 2 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
FCT
2007
Springer
9 years 2 months ago
Complexity of Pebble Tree-Walking Automata
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
Mathias Samuelides, Luc Segoufin
books