Slender 0L languages
type: Item
instance of: scholarly article
title: Slender 0L languages
zbMATH Open document ID: 0871.68115
DOI: 10.1016/0304-3975(95)00067-4
author: Taishin Yasunobu Nishida
author: Arto Salomaa
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 984395
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00067-4
OpenAlex ID: W2006086486
cites work: Language-theoretic problems arising from Richelieu cryptosystems
cites work: Q5526125
cites work: Q4431364
cites work: Description of developmental languages using recurrence systems
cites work: Q4036758
cites work: On a conjecture about slender context-free languages
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
cites work: Quasi-deterministic 0L systems
cites work: Quasi-deterministic 0L systems and their representation
cites work: Q4005193
cites work: Closure properties of slender languages
cites work: Length considerations in context-free languages
cites work: Q4140407
cites work: Q4294173
cites work: Q4884900
cites work: Q4001349
description: scientific article; zbMATH DE number 984395