433 search results - page 9 / 87 » On stabilizers of infinite words |
93
Voted
ITA
2002
15 years 10 days ago
2002
Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a word is the ratio between the number of p...
109
Voted
IPL
2002
15 years 10 days ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
93
Voted
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
80
Voted
COLING
1996
15 years 2 months ago
1996
In this paper we present a GB-parsing system for German and in particular the system's strategy for argument interpretation, which copes with the difficulty that word order i...
CHINAF
2008
15 years 23 days ago
2008
: The input-to-state stability (ISS) problem is studied for switched systems with infinite subsystems. By the method of multiple Lyapunov function, a sufficient ISS condition is gi...