Pages that link to "Item:Q5733984"
From MaRDI portal
The following pages link to On the synchronizing properties of certain prefix codes (Q5733984):
Displaying 22 items.
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- On extendibility of unavoidable sets (Q1094146) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- Prefix codes, trees, and automata (Q1217779) (← links)
- Maximale Länge von Folgen ohne trennende Teilblöcke (Q1394342) (← links)
- Open maps: small and large holes with unusual properties (Q1791656) (← links)
- An optimal test on finite unavoidable sets of words (Q1836993) (← links)
- Unavoidable sets of words of uniform length (Q1854517) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata (Q2292858) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- On the values attained by a \(k\)-regular sequence (Q2568113) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- The baker’s map with a convex hole (Q3176535) (← links)
- Unavoidable Set: Extension and Reduction (Q4718891) (← links)
- Unavoidable languages, cuts and innocent sets of words (Q4858836) (← links)
- (Q4993532) (← links)
- (Q5005121) (← links)
