79
Voted
JUCS
2002
14 years 12 months ago
2002
: Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them pr...
105
Voted
IPL
2002
14 years 12 months 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...
102
Voted
TCS
2008
15 years 5 days ago
2008
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
81
Voted
IPL
2006
15 years 7 days ago
2006
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
106
Voted
ITA
2008
15 years 7 days ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
87
Voted
ITA
2008
15 years 7 days ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
87
Voted
FUIN
2008
15 years 9 days ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
77
Voted
CORR
2010
Springer
15 years 10 days ago
2010
Springer
: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existenc...
95
Voted
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
Carrying on the work of Arnold, P