Sciweavers

Share
JUCS
2002
123views more  JUCS 2002»
8 years 9 months ago
Bridging Two Hierarchies of Infinite Words
: 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...
Solomon Marcus
IPL
2002
117views more  IPL 2002»
8 years 9 months ago
Complexity of weak acceptance conditions in tree automata
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...
Jakub Neumann, Andrzej Szepietowski, Igor Walukiew...
TCS
2008
8 years 10 months ago
On different generalizations of episturmian words
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...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
IPL
2006
74views more  IPL 2006»
8 years 10 months ago
Periodic and Sturmian languages
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 ...
Lucian Ilie, Solomon Marcus, Ion Petre
ITA
2008
119views Communications» more  ITA 2008»
8 years 10 months ago
Some Algebraic Properties of Machine Poset of Infinite Words
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 ...
Aleksandrs Belovs
ITA
2008
137views Communications» more  ITA 2008»
8 years 10 months ago
Drunken man infinite words complexity
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...
Marion Le Gonidec
FUIN
2008
99views more  FUIN 2008»
8 years 10 months ago
Universality Analysis for One-Clock Timed Automata
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...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
CORR
2010
Springer
98views Education» more  CORR 2010»
8 years 10 months ago
Strategical languages of infinite words
: 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...
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
LATIN
1998
Springer
9 years 2 months ago
Positive Varieties and Infinite Words
Carrying on the work of Arnold, P
Jean-Eric Pin
books