2 citations · 2 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
Linear equations and recursively enumerable sets
Juha Honkala
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representa…
cs.FL2023
Commuting upper triangular binary morphisms
Juha Honkala
A morphism from the free monoid into itself is called upper triangular if the matrix of is upper triangular. We characterize all upper triangular binary morphisms $g_…
cs.FL2009
The equality problem for infinite words generated by primitive morphisms
Juha Honkala
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 primi…