433 search results - page 54 / 87 » On stabilizers of infinite words |
FORMATS
2007
Springer
14 years 2 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Equivocation has been widely used as a measure of security after Shannon[10]. For an infinite system such as the wiretap channel defined in [2], equivocation is unbounded and so e...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--The problem of data stream classification is challenging because of many practical aspects associated with efficient processing and temporal behavior of the stream. Two s...