DOIAbstract
The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horváth, J. Karhumäki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations
The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horváth, J. Karhumäki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractIn this paper, we prove decidability properties and new results on the position of the famil...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractIn 2002, Jurdziński and Loryś settled a long-standing conjecture that palindromes are not a ...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractIn this paper, we prove decidability properties and new results on the position of the famil...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
The palindromization map ψ in a free monoid A* was introduced in 1997 by the first author in the cas...
AbstractIn 2002, Jurdziński and Loryś settled a long-standing conjecture that palindromes are not a ...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractThe palindromization map ψ in a free monoid A∗ was introduced in 1997 by the first author in...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractIn this paper, we prove decidability properties and new results on the position of the famil...
Add to ORKG