On the subword complexity of m-free DOL languages
type: Item
instance of: scholarly article
title: On the subword complexity of m-free DOL languages
zbMATH Open document ID: 0526.68067
DOI: 10.1016/0020-0190(83)90050-9
author: Andrzej Ehrenfeucht
author: Grzegorz Rozenberg
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3835377
zbMATH Keywords: DOL languages
zbMATH Keywords: subword complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90050-9
OpenAlex ID: W1999191302
cites work: Q3860007
cites work: Q3959451
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: On the size of the alphabet and the subword complexity of square-free DOL languages
cites work: Q3939259
cites work: Q4140407
cites work: Q3948608
description: scientific article; zbMATH DE number 3835377