493 search results - page 23 / 99 » Alternating Weighted Automata |
COR
2006
13 years 8 months ago
2006
Data envelopment analysis (DEA) is proposed in this paper to generate local weights of alternatives from pair-wise comparison judgment matrices used in the analytic hierarchy proc...
ACTA
2006
13 years 8 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
VMCAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
JALC
2007
13 years 8 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, ...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...