Binary words avoiding the pattern AABBCABBA

Artículos similares

On the complex of problems for the study of the necessary conditions for the equality of infinite iterations of finite languages

Acceso

Boris Melnikov Pág. 1 - 12

In some previous publications, we investigated the properties of a special binary relation, which was sometimes called the equivalence relation at infinity. For a pair of finite languages, the equality of infinite iterations of these langu... ver más

Revista: International Journal of Open Information Technologies

A polynomial algorithm for constructing a finite automaton for determining the equality of infinite iterations of two finite languages

Acceso

Boris Melnikov,Aleksandra Melnikova Pág. 1 - 10

In this paper, we continue the topic related to the special binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages); this is so called equivalence relation at infinity. We have formulat... ver más

Revista: International Journal of Open Information Technologies

Optimal Versus Randomized Search of Fixed Length Binary Words

Acceso

Prodinger, H. Szpankowski, W. Pág. 2614 - 2620

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

CORRESPONDENCE - The Estimated Cost of a Search Tree on Binary Words

Acceso

Fedotov, A; Ryabko, B Pág. 326 - 329

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Artículos similares

Revistas destacadas