AbstractWe study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of finding all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponents
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method o...
Táto diplomová práca pojednáva o non-pushy a cirkulárnych D0L-systémoch. Poskytujeme v nej prehľad h...
summary:We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial m...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
AbstractA conjecture of M. Billaud is: given a word w, if, for each letter x occurring in w, the wor...
peer reviewedGeneralizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th ...
The Dual Post Correspondence Problem asks, for a given word α, if there exists a non-periodic morphi...
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular...
Let t be the infinite fixed point, starting with 1, of the morphism ¯ : 0 ! 01, 1 ! 10. An infinite ...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractWe study a generalization of DT0L systems obtained by considering noncommutative polynomials...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method o...
Táto diplomová práca pojednáva o non-pushy a cirkulárnych D0L-systémoch. Poskytujeme v nej prehľad h...
summary:We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial m...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
AbstractA conjecture of M. Billaud is: given a word w, if, for each letter x occurring in w, the wor...
peer reviewedGeneralizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th ...
The Dual Post Correspondence Problem asks, for a given word α, if there exists a non-periodic morphi...
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular...
Let t be the infinite fixed point, starting with 1, of the morphism ¯ : 0 ! 01, 1 ! 10. An infinite ...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractWe study a generalization of DT0L systems obtained by considering noncommutative polynomials...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
DOI
Add to ORKG