34 search results - page 3 / 7 » A characterization of fine words over a finite alphabet |
127
click to vote
STRINGOLOGY
2008
14 years 11 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
DM
2010
14 years 9 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
77
Voted
DLT
2006
14 years 10 months ago
2006
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...