Quasi-deterministic 0L systems and their representation
type: Item
instance of: scholarly article
title: Quasi-deterministic 0L systems and their representation
zbMATH Open document ID: 0873.68119
DOI: 10.1016/0304-3975(94)00250-M
author: Taishin Yasunobu Nishida
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 985005
zbMATH Keywords: 0L system
MaRDI profile type: Publication
cites work: Q3711770
cites work: Simplifications of homomorphisms
cites work: Description of developmental languages using recurrence systems
cites work: Q5592246
cites work: Periodicity and ultimate periodicity of D0L systems
cites work: Q4116297
cites work: Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
cites work: Quasi-deterministic 0L systems
cites work: Repeatable words for substitution
cites work: Ambiguity in the developmental systems of Lindenmayer
cites work: Q4140407
cites work: Q4884900
full work available at URL: 0304-3975(94)00250-m
OpenAlex ID: W2040044787
Recommended article: Quasi-deterministic 0L systems
Recommended article: Quasilogical systems and their stability
Recommended article: Q3692874
Recommended article: Q3734224
Recommended article: Approximate Determinization of Quantitative Automata
Recommended article: Well (and Better) Quasi-Ordered Transition Systems
Recommended article: Quasi-canonical systems and their semantics
Recommended article: Membrane Computing
Recommended article: Function-limited \(0L\) systems revisited
Recommended article: Q4874647
description: scientific article; zbMATH DE number 985005