On the synchronizing properties of certain prefix codes
From MaRDI portal
Publication:5733984
DOI10.1016/S0019-9958(64)90232-3zbMath0122.15004OpenAlexW1999907474MaRDI QIDQ5733984
Publication date: 1964
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(64)90232-3
Related Items
On extendibility of unavoidable sets, The baker’s map with a convex hole, Optimal synchronous coding, Crucial words and the complexity of some extremal problems for sets of prohibited words, Inventories of unavoidable languages and the word-extension conjecture, Maximale Länge von Folgen ohne trennende Teilblöcke, Unnamed Item, Unavoidable languages, cuts and innocent sets of words, Unnamed Item, Semaphore Codes and Ideals, Number of holes in unavoidable sets of partial words. II., UNAVOIDABLE SETS OF CONSTANT LENGTH, Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, Hybrid and generalized marked systems, On the decomposition of prefix codes, Growth of repetition-free words -- a review, Prefix codes, trees, and automata, On the groups of codes with empty kernel., Unavoidable sets and circular splicing languages, Open maps: small and large holes with unusual properties, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Unavoidable Set: Extension and Reduction, An optimal test on finite unavoidable sets of words, On the values attained by a \(k\)-regular sequence, The Synchronizing Probability Function for Primitive Sets of Matrices, Unavoidable sets of words of uniform length
