Equivalence of right infinite words

DOI10.1155/2013/219291MaRDI QIDQ2249922zbMATH OpenOpenAlexWikidataFDO

Authors Liga Kulesa

Publication date 4 July 2014

Published in Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/219291

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Review text

Summary: Closure properties of some classes of right infinite words have been studied extensively; we are interested in the general algebraic structure of right infinite words. We investigate preorder of morphism invariant classes and show that it is not a semilattice.

Recommendations

• The equality problem for infinite words generated by primitive morphisms
• Infinite words and biprefix codes
• scientific article; zbMATH DE number 2150291
• On the subword equivalence problem for infinite words
• On the subword equivalence problem for morphic words

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• Iteration of maps by an automaton
• Sequences close to periodic
• Some Algebraic Properties of Machine Poset of Infinite Words
• Uniform tag sequences

This page was built for publication: Equivalence of right infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249922)