4 search results - page 1 / 1 » Derandomization of Probabilistic Auxiliary Pushdown Automata... |
COCO
2006
Springer
13 years 8 months ago
2006
Springer
LMCS
2006
13 years 4 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
FCT
1991
Springer
13 years 8 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
AMAST
2006
Springer
13 years 8 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...