2632 search results - page 5 / 527 » Alternating Timed Automata |
IANDC
2007
14 years 9 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
74
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
JALC
2007
14 years 9 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
