On the size of the alphabet and the subword complexity of square-free DOL languages
type: Item
instance of: scholarly article
title: On the size of the alphabet and the subword complexity of square-free DOL languages
zbMATH Open document ID: 0512.68058
DOI: 10.1007/BF02572832
published in: Semigroup Forum
publication date: 1983-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/134604
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3808974
zbMATH Keywords: square-free DOL language
author: Andrzej Ehrenfeucht
author: Grzegorz Rozenberg
MaRDI profile type: Publication
cites work: Avoidable patterns in strings of symbols
cites work: On the subword complexity of square-free DOL languages
cites work: On the subword complexity of DOL languages with a constant distribution
cites work: Q4746787
cites work: Q3948608
OpenAlex ID: W2014919645
description: scientific article; zbMATH DE number 3808974