206 search results - page 4 / 42 » Weak Alternating Automata Are Not That Weak |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
CIE
2007
Springer
13 years 11 months ago
2007
Springer
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
SACRYPT
2009
Springer
14 years 2 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...