Abstract
Fragile words have been already considered in the context of automata groups. Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words. Among other properties, we show that there exists a one-to-one correspondence between the set of Catalan fragile words and the set of full binary trees.
Originalsprache | englisch |
---|---|
Seiten (von - bis) | 69-80 |
Fachzeitschrift | International Journal of Group Theory |
Jahrgang | 9 |
Ausgabenummer | 2 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2019 |