The paper studies stability in L systems using a new approach. Given an L system G, a word w is said to be k-stable in G if, once w occurs in a derivation, the derivation can proceed no more than k steps before the next occurrence of w. The set of k-stable words in an L system is called by the author the k-stable language of the system. Thus, the notion of k- stable languages is a generalization of the notion of adult languages introduced by \textit{A. Walker} [Lect. Notes Comput. Sci. 15, 201-215 (1974; Zbl 0296.68077)]. The class of k-stable languages of OL systems is shown to be equal to the class of adult languages of OL systems. It is also proved that similar results hold for the class of k-stable languages of PIL and IL systems, respectively. Hence, a new characterization of context-free, context-sensitive and recursively enumerable languages in terms of parallel grammars is obtained.
- Context-free and stationary languagest†
- Description of developmental languages using recurrence systems
- scientific article; zbMATH DE number 3464866 (Why is no real title available?)
- scientific article; zbMATH DE number 3540642 (Why is no real title available?)
- scientific article; zbMATH DE number 3637300 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On the stability of some biological schemes with cellular interactions
- Stable string languages of lindenmayer systems
- Repeatable words for substitution
- scientific article; zbMATH DE number 4215929 (Why is no real title available?)
- scientific article; zbMATH DE number 3915349 (Why is no real title available?)
- scientific article; zbMATH DE number 1747448 (Why is no real title available?)
- On equality between fuzzy context-free and fuzzy adult 0L languages
- Stability of desynchronized 0L-systems
This page was built for publication: Stability in L systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802316)
