ScholarLens Back to search
2009•arXiv (Cornell University)Open access

The equality problem for infinite words generated by primitive morphisms

Juha Honkala

Open full text 0 citations

Abstract

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.

Open-access reader

About this research paper

What this paper is about

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.

Key concepts: Morphism, Mathematics, Computer science, Algebra over a field, Combinatorics, Pure mathematics

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
The equality problem for infinite words generated by primitive morphisms — Research Paper | ScholarLens