493 search results - page 16 / 99 » Alternating Weighted Automata |
MFCS
1994
Springer
14 years 21 days 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...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
DLT
2008
13 years 10 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
COR
2008
13 years 8 months ago
2008
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...