56 search results - page 8 / 12 » jucs 2002 |
100
click to vote
JUCS
2002
14 years 11 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
JUCS
2002
14 years 11 months ago
2002
: Different models and methodologies for the development of hypermedia systems and applications have emerged in the recent years. Software-technical methods and principles enriched...
110
Voted
JUCS
2002
14 years 11 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
108
click to vote
JUCS
2002
14 years 11 months ago
2002
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
JUCS
2002
14 years 11 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...