On the subword complexity of square-free DOL languages
type: Item
instance of: scholarly article
title: On the subword complexity of square-free DOL languages
zbMATH Open document ID: 0481.68073
DOI: 10.1016/0304-3975(81)90028-1
author: Andrzej Ehrenfeucht
author: Grzegorz Rozenberg
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 3755896
zbMATH Keywords: DOL systems
zbMATH Keywords: nonrepetitive sequences
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90028-1
OpenAlex ID: W1987010753
cites work: Q3860007
cites work: Mots sans carre et morphismes iterés
cites work: Classification of noncounting events
cites work: Subword complexities of various classes of deterministic developmental languages without interactions
cites work: Q3899529
cites work: Q3959451
cites work: Q4198075
cites work: Q4151737
cites work: Q4140407
description: scientific article; zbMATH DE number 3755896