Černý's conjecture and the road colouring problem (Q2074216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q376116 / rank
Normal rank
 
Property / author
 
Property / author: Mikhail V. Volkov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COMPAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of topological Markov shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Reset Thresholds with Greedy Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic algorithm for road coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum length of synchronizing words is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Algorithmic Problems about Synchronizing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probability of Being Synchronizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic synchronization criterion and computing reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dixon's theorem and random synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of statistically synchronizable variable-length codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of relatively prime length and the road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Synchronization Problem for Locally Strongly Transitive Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of oblivious plans for orienting and distinguishing polygonal parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPAS - A Computing Package for Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: DFAs and PFAs with long shortest synchronizing word length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of dynamical systems arising from substitutions of constant length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding DFAs with Maximal Shortest Synchronizing Word Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaps in the exponent set of primitive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attainable Values of Reset Thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing modular coincidences for substitution tilings and point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Road Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Inapproximability of the Shortest Reset Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Reset Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-identification experiments in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting polygonal parts without sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Interplay Between Černý and Babai’s Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of the independence number and automata synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Synchronizing Colorings of Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the shortest reset words of synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Synchronizing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Small Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata with Extremal Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing certain bounds concerning finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Studies. (AM-34) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cerny Conjecture Holds with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road-colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Reset Words in Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithm for Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata with short reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete solution to the complexity of synchronizing road coloring for non-binary alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal bound of recurrent word length for regular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the length of reset words for automata with simple idempotents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition sequences for functions over a finite domain. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Study of the Shortest Reset Word of Random Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Averaging Trick and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Černý conjecture for one-cluster automata with prime length cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Series of Eulerian Synchronizing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying the Upper Bound on the Length of Minimal Synchronizing Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of road coloring with prescribed reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unzerlegbare, nicht negative Matrizen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing random automata on a 4-letter alphabet / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:59, 27 July 2024

scientific article
Language Label Description Also known as
English
Černý's conjecture and the road colouring problem
scientific article

    Statements

    Černý's conjecture and the road colouring problem (English)
    0 references
    0 references
    0 references
    4 February 2022
    0 references
    Summary: For the entire collection see [Zbl 1470.68001].
    0 references
    sychronising automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers