On the subword complexity of locally catenative DOL languages
type: Item
instance of: scholarly article
title: On the subword complexity of locally catenative DOL languages
zbMATH Open document ID: 0501.68038
DOI: 10.1016/0020-0190(83)90003-0
author: Andrzej Ehrenfeucht
author: Grzegorz Rozenberg
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3789852
zbMATH Keywords: formal languages
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90003-0
OpenAlex ID: W2061655701
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: Q3939259
cites work: Q4140407
description: scientific article; zbMATH DE number 3789852