Sciweavers

433 search results - page 13 / 87
» On stabilizers of infinite words
Sort
View
FCT
2009
Springer
13 years 11 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
APAL
2008
104views more  APAL 2008»
13 years 8 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
TIT
2008
97views more  TIT 2008»
13 years 7 months ago
Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
The problem of predicting a sequence x ; x ; . . . generated by a discrete source with unknown statistics is considered. Each letter x is predicted using the information on the wor...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
13 years 8 months ago
Stability and stabilization of nonuniform sampling systems
This paper is concerned with nonuniform sampling systems, where the sampling interval is time-varying within a certain known bound. The system is transformed into a time-varying d...
Young Soo Suh
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 8 months ago
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Abstract. The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hier...
Olivier Finkel