128 search results - page 6 / 26 » An Implicit Characterization of PSPACE |
105
Voted
FUIN
2000
15 years 3 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
155
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
138
click to vote
TSP
2012
13 years 11 months ago
2012
—Modeling natural and artificial systems has played a key role in various applications and has long been a task that has drawn enormous efforts. In this work, instead of explori...
122
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
105
Voted
TACS
2001
Springer
15 years 7 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...