Regularity of sets of initial strings of periodic D0L-systems
type: Item
instance of: scholarly article
title: Regularity of sets of initial strings of periodic D0L-systems
zbMATH Open document ID: 0626.68055
DOI: 10.1016/0304-3975(86)90086-1
author: Tom Head
author: Barbara Lando
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: For an alphabet A and a morphism \(h: A^*\to A^*\), the set of words w such that the D0L-system (A,h,w) is periodic is shown to be a noncounting, regular language. Use is made of the authors' recent investigations of periodic D0L-systems.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 4018403
zbMATH Keywords: regular language
zbMATH Keywords: periodic D0L-systems
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90086-1
OpenAlex ID: W1991943033
cites work: Q4089754
cites work: On the periodicity of morphisms on free monoids
cites work: Q3711767
cites work: Periodic D0L languages
cites work: Q3659988
cites work: Q5641083
cites work: Decidability of periodicity for infinite words
cites work: Q4140407
cites work: Q3948608
description: scientific article; zbMATH DE number 4018403