Stability of desynchronized 0L-systems
A 0L scheme (\(\Sigma\),g) is defined to be \(\Delta\)-desynchronization of \(S=(\Sigma,h)\) if \(g(a)=\{a,h(a)\}\) for \(a\in \Delta\), \(g(a)=h(a)\) otherwise. For a 0L system \(G=(\Sigma,h,w)\) whose underlying scheme is equal to \(S=(\Sigma,h)\) the \(\Delta\)-desynchronization of S induces \(\Delta\)-desynchronization of G. A system G is defined to be stable under \(\Delta\)-desynchronization w.r.t. a target \(T\subseteq \Sigma^*\) if \(T\cap L(G)=T\cap L(G^ d(\Delta)),\) where L(G) is a language generated by G and \(G^ d(\Delta)\) is \(\Delta\)-desynchronization of G. It is proved that a 0L system is stable under \(\Sigma\)-desynchronization w.r.t. the set of recurrent strings and it is stable under \(\Delta\)- desynchronization w.r.t. the set of adult strings.
- CONCEPT ADVANTAGES OF DISCRETE EVENT FORMALISM
- Context free languages in biological systems
- Description of developmental languages using recurrence systems
- Formal grammars and the regeneration capability of biological systems
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- Recurrent words for substitution
- Stability in OL systems
- Algebraic unsolvability of problem of absolute stability of desynchronized systems
- Stability in OL systems
- scientific article; zbMATH DE number 3954776 (Why is no real title available?)
- Recurrent words for substitution
- scientific article; zbMATH DE number 1747448 (Why is no real title available?)
- Quasi-deterministic 0L systems
- Languages and P0L schemes
- Stability in L systems
This page was built for publication: Stability of desynchronized 0L-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794173)