Characterization of unary developmental languages
From MaRDI portal
Publication:1843172
DOI10.1016/0012-365X(73)90096-4zbMath0279.68062OpenAlexW2043354512WikidataQ127370769 ScholiaQ127370769MaRDI QIDQ1843172
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(73)90096-4
Related Items (13)
Extension of tabled 0L-systems and languages ⋮ (g//0,g//1,\dots ,g//k)-trees and unary OL systems ⋮ On a family of acceptors for some classes of developmental languages ⋮ On the union of 0L languages ⋮ Decidability of operation problems for T0L languages and subclasses ⋮ Ambiguity in the developmental systems of Lindenmayer ⋮ Subword complexities of various classes of deterministic developmental languages without interactions ⋮ On the number of subwords of everywhere growing DTOL languages ⋮ Problèmes decidables concernant les TOL-langages unaires ⋮ Solution of a decision problem concerning unary Lindenmayer systems ⋮ DOL sequences ⋮ Synchronized EOL forms ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Development systems with locally catenative formulas
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- The equivalence problem for deterministic TOL-systems is undecidable
- TOL systems and languages
- Two Families of Languages Related to ALGOL
- A note on some systems of lindenmayer
- I. General description and the problem of universal computing ability
- On 0L-Languages
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
This page was built for publication: Characterization of unary developmental languages