Displaying similar documents to “Complexity of testing morphic primitivity”

Factor frequencies in generalized Thue-Morse words

Ľubomíra Balková (2012)

Kybernetika

Similarity:

We describe factor frequencies of the generalized Thue-Morse word 𝐭 b , m defined for b 2 , m 1 , b , m , as the fixed point starting in 0 of the morphism ϕ b , m ( k ) = k ( k + 1 ) ( k + b - 1 ) , where k { 0 , 1 , , m - 1 } and where the letters are expressed modulo m . We use the result of Frid [4] and the study of generalized Thue-Morse words by Starosta [6].

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system is star-like with...

On an algorithm for testing T4 solvability of max-plus interval systems

Helena Myšková (2012)

Kybernetika

Similarity:

In this paper, we shall deal with the solvability of interval systems of linear equations in max-plus algebra. Max-plus algebra is an algebraic structure in which classical addition and multiplication are replaced by and , where a b = max { a , b } , a b = a + b . The notation 𝔸 x = 𝕓 represents an interval system of linear equations, where 𝔸 = [ b ¯ , A ¯ ] and 𝕓 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 solvability and...