2632 search results - page 139 / 527 » Alternating Timed Automata |
116
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
131
Voted
SACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
The Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for the design of stream ciphers. FCSRs have good st...
136
Voted
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
132
Voted
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountabl...
129
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...