Concentration dependent OL systems

DOI10.1080/00207167908803171zbMATH Open0453.68042OpenAlexW2086888416MaRDI QIDQ3901009FDOQ3901009

Authors: Jürgen Dassow 

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803171

zbMATH Keywords

growth functionshomomorphismsdecision problemsregulated rewritinggenerative powerL systemsdevelopmental languagesdeterministic tabled OL systemnonterminals

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the decidability of some equivalence problems for DOL-systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
• Priorities on context conditions in rewriting systems
• The equivalence problem for deterministic TOL-systems is undecidable
• Title not available (Why is that?)
• On the synthesis of DOL growth
• The length sets of D0L languages are uniformly bounded
• Some properties of the class of \(L\) languages with interactions
• DOL sequences
• On the periodicity of word-length in DOL languages

Cited In (1)

• Information transmission in il systems^∗

This page was built for publication: Concentration dependent OL systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901009)