Synchronizing delay for binary uniform morphisms
From MaRDI portal
Abstract: Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upper bound on the minimal value of a synchronizing delay of a circular D0L-system with a binary uniform morphism is given.
Recommendations
- A tight linear bound on the synchronization delay of bijective automata
- Deterministic synchronization of automata with bounded delay
- Bounded synchronization delay in omega-rational expressions
- On the bound of the synchronization delay of a local automaton
- scientific article; zbMATH DE number 4055012
- Binary generalized synchronization
- On synchronizing automata and uniform distribution
- Synchronization of Boolean networks with time delays
- On the synchronization of delay discrete models
- Codes with bounded synchronization delay
Cites work
- scientific article; zbMATH DE number 1375592 (Why is no real title available?)
- scientific article; zbMATH DE number 1088280 (Why is no real title available?)
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Bispecial factors in circular non-pushy D0L languages
- Characterization of circular D0L-systems
- If a DOL language is k-power free then it is circular
- On Critical exponents in fixed points ofk-uniform binary morphisms
- Repetition of subwords in DOL languages
- The equation \(a_ M=b^ Nc^ P\) in a free group
Cited in
(2)
This page was built for publication: Synchronizing delay for binary uniform morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906381)
