Language-theoretic complexity of disjunctive sequences
type: Item
instance of: scholarly article
title: Language-theoretic complexity of disjunctive sequences
zbMATH Open document ID: 0894.68091
DOI: 10.1016/S0166-218X(97)00061-9
published in: Discrete Applied Mathematics
publication date: 1998-03-25T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1133171
zbMATH Keywords: disjunctive sequences
author: Cristian S. Calude
author: Sheng Yu
MaRDI profile type: Publication
cites work: Language-theoretic problems arising from Richelieu cryptosystems
cites work: Theories of computational complexity
cites work: Q4326782
cites work: Most numbers obey no probability laws
cites work: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
cites work: Q3995518
cites work: Q5592246
cites work: On a conjecture about slender context-free languages
cites work: Q4318993
cites work: Thin and slender languages
cites work: Characterizing regular languages with polynomial densities
cites work: Length considerations in context-free languages
OpenAlex ID: W2005414426
description: scientific article; zbMATH DE number 1133171