433 search results - page 13 / 87 » On stabilizers of infinite words |
100
Voted
FCT
2009
Springer
15 years 2 months ago
2009
Springer
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...
101
click to vote
APAL
2008
14 years 11 months ago
2008
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...
TIT
2008
14 years 11 months ago
2008
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...
AUTOMATICA
2008
14 years 11 months ago
2008
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...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
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...