On the synchronizing properties of certain prefix codes
From MaRDI portal
Cited in
(27)- On extendibility of unavoidable sets
- Inventories of unavoidable languages and the word-extension conjecture
- Prefix codes, trees, and automata
- Maximale Länge von Folgen ohne trennende Teilblöcke
- Open maps: small and large holes with unusual properties
- An optimal test on finite unavoidable sets of words
- Unavoidable sets of words of uniform length
- Hybrid and generalized marked systems
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Growth of repetition-free words -- a review
- On the values attained by a \(k\)-regular sequence
- Minimum number of holes in unavoidable sets of partial words of size three
- The baker’s map with a convex hole
- Semaphore Codes and Ideals
- Number of holes in unavoidable sets of partial words. II.
- Unavoidable Set: Extension and Reduction
- Optimal synchronous coding
- Unavoidable languages, cuts and innocent sets of words
- Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges's theorem
- Finding short synchronizing words for prefix codes
- On the decomposition of prefix codes
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Finite maximal codes and factorizations of cyclic groups
- Unavoidable sets and circular splicing languages
- On the groups of codes with empty kernel.
This page was built for publication: On the synchronizing properties of certain prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5733984)
