11 search results - page 1 / 3 » Iterated pushdown automata and sequences of rational numbers |
APAL
2006
13 years 5 months ago
2006
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
FOSSACS
2009
Springer
13 years 8 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...