Equations in words: An algorithmic contribution.
Néraud, Jean (1994)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
The search session has expired. Please query the service again.
Displaying similar documents to “On separating sets of words. I.”
Equations in words: An algorithmic contribution.
On separating sets of words. III.
Václav Flaška, Tomáš Kepka, Juha Kortelainen (2010)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Updown numbers and the initial monomials of the slope variety.
Martin, Jeremy L., Wagner, Jennifer D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Borders and roots of a word
Silberger, D.M. (1971)
Portugaliae mathematica
Similarity:
Bordered conjugates of words over large alphabets.
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some problems related to palindrome closure
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if is an involutory antimorphism of , then the right and left -palindromic closures of any factor of a -standard word are also factors of some -standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure...
Axiomatizing omega and omega-op powers of words
Stephen L. Bloom, Zoltán Ésik (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Asymptotic behaviour of bi-infinite words
Wit Foryś (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.
Directive words of episturmian words : equivalences and normalization
Amy Glen, Florence Levé, Gwénaël Richomme (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing the same episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As...