76 search results - page 4 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
85
Voted
STACS
1999
Springer
15 years 3 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
102
Voted
LATA
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
ISTCS
1997
Springer
15 years 3 months ago
1997
Springer
105
Voted
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
MFCS
1994
Springer
15 years 3 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...