433 search results - page 23 / 87 » On stabilizers of infinite words |
FLAIRS
2000
13 years 9 months ago
2000
For manyknowledgeintensive applications, it is necessary to have extensive domain-specific knowledgein addition to general-purpose knowledge bases usually built around MachineRead...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
SIAMDM
2008
13 years 7 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
CSL
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...