For a given language L, we study the languages X such that for all distinct words u, v ∈ L, there exists a word x ∈ X that appears a different number of times as a factor in u and in v. In particular, we are interested in the following question: For which languages L does there exist a finite language X satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In the paper we consider cellular automata defined on metric spaces (AN, d) or (AZ, d) endowed with the uniform Bernoulli measure ž and present general constructions of such automata which are sur- jective, not positively expansive and ž is the measure of the maximal and positive entropy.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.