Subword complexities of various classes of deterministic developmental languages without interactions
type: Item
instance of: scholarly article
title: Subword complexities of various classes of deterministic developmental languages without interactions
zbMATH Open document ID: 0316.68043
DOI: 10.1016/0304-3975(75)90012-2
author: S. Singh
published in: Theoretical Computer Science
publication date: 1975-01-01T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/16407
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3495607
MaRDI profile type: Publication
OpenAlex ID: W2005768337
cites work: Q5653575
cites work: A limit theorem for set of subwords in deterministic TOL laguages
cites work: Characterization of unary developmental languages
cites work: Description of developmental languages using recurrence systems
cites work: The length sets of D0L languages are uniformly bounded
cites work: Q4124350
cites work: Integral sequential word functions and growth equivalence of lindenmayer systems
cites work: DOL sequences
cites work: Q4060423
cites work: On 0L-Languages
cites work: Development systems with locally catenative formulas
cites work: Q5684248
cites work: Q5666178
description: scientific article; zbMATH DE number 3495607