Affordable Access

Publisher Website

Binary equality sets are generated by two words

Authors
Journal
Journal of Algebra
0021-8693
Publisher
Elsevier
Publication Date
Volume
259
Issue
1
Identifiers
DOI: 10.1016/s0021-8693(02)00534-3

Abstract

Abstract We show that the equality set Eq( g, h) of two non-periodic binary morphisms g,h :A ∗→Σ ∗ is generated by at most two words. If the rank of Eq(g,h)={α,β} ∗ is two, then α and β begin and end with different letters. This in particular implies that any binary language has a test set of cardinality at most two.

There are no comments yet on this publication. Be the first to share your thoughts.