An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
From MaRDI portal
Publication:5756675
DOI10.1007/11821069_68zbMath1132.68463OpenAlexW2106446429MaRDI QIDQ5756675
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_68
Related Items
Shortest synchronizing strings for Huffman codes, Primitive digraphs with large exponents and slowly synchronizing automata, Synchronizing automata with a letter of deficiency 2, Synchronizing Automata with Extremal Properties, Complexity of road coloring with prescribed reset words, Lower Bounds for Synchronizing Word Lengths in Partial Automata, Synchronizing Automata and the Černý Conjecture, Černý conjecture for edge-colored digraphs with few junctions, A multi-parameter analysis of hard problems on deterministic finite automata, Finding DFAs with Maximal Shortest Synchronizing Word Length, Černý's conjecture and group representation theory, Shortest Synchronizing Strings for Huffman Codes, The Černý conjecture for one-cluster automata with prime length cycle, On the Synchronizing Probability Function and the Triple Rendezvous Time, COMPAS - A Computing Package for Synchronization, Slowly synchronizing automata with fixed alphabet size, Extremal synchronizing circular automata, Matrix Mortality and the Černý-Pin Conjecture, Experiments with Synchronizing Automata, Černý's conjecture and the road colouring problem, Attainable Values of Reset Thresholds, The Synchronizing Probability Function for Primitive Sets of Matrices, Computing the shortest reset words of synchronizing automata
Uses Software
