An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
From MaRDI portal
Recommendations
- Algorithms for Finding Good Examples for the abc and Szpiro Conjectures
- Algorithmic aspects of Suslin's proof of Serre's conjecture
- An algorithm to construct candidates to counterexamples to the Zassenhaus conjecture
- scientific article; zbMATH DE number 5130830
- scientific article; zbMATH DE number 7651162
- An algorithm for testing Leopoldt's conjecture
- scientific article; zbMATH DE number 1092062
- Counterexamples revisited: principles, algorithms, applications
- An algorithm for Komlós conjecture matching Banaszczyk's bound
- An algorithmic approach to Ramanujan's congruences
Cited in
(28)- Slowly synchronizing automata with fixed alphabet size
- Extremal synchronizing circular automata
- Černý's conjecture and the road colouring problem
- A multi-parameter analysis of hard problems on deterministic finite automata
- Černý's conjecture and group representation theory
- Computing the shortest reset words of synchronizing automata
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- Experiments with Synchronizing Automata
- Synchronizing Automata with Extremal Properties
- COMPAS -- a computing package for synchronization
- Modifying the upper bound on the length of minimal synchronizing word
- Synchronizing Automata and the Černý Conjecture
- Shortest Synchronizing Strings for Huffman Codes
- Matrix Mortality and the Černý-Pin Conjecture
- Primitive digraphs with large exponents and slowly synchronizing automata
- Černý conjecture for edge-colored digraphs with few junctions
- Attainable values of reset thresholds
- Generating small automata and the Černý conjecture
- Lower bounds for synchronizing word lengths in partial automata
- The Černý conjecture for aperiodic automata
- Synchronization of Some DFA
- Finding DFAs with maximal shortest synchronizing word length
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Reset sink complexity of regular ideals
- An improved algorithm for finding the shortest synchronizing words
- The Černý conjecture for one-cluster automata with prime length cycle
- Shortest synchronizing strings for Huffman codes
- Synchronizing automata with a letter of deficiency 2
This page was built for publication: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756675)
