scientific article; zbMATH DE number 7228447
From MaRDI portal
Publication:3304155
Recommendations
- Strong inapproximability of the shortest reset word
- scientific article; zbMATH DE number 846959
- A fast algorithm finding the shortest reset words
- Lower bounds for the length of reset words in Eulerian automata
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- Modifying the upper bound on the length of minimal synchronizing word
- Tight lower bounds on the length of word chains
- scientific article; zbMATH DE number 897906
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Computing the shortest reset words of synchronizing automata
Cites work
- A note on a recent attempt to improve the Pin-Frankl bound
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- A series of slowly synchronizing automata with a zero state over a small alphabet
- An extremal problem for two families of sets
- Approximation of reset thresholds with greedy algorithms
- Experiments with Synchronizing Automata
- scientific article; zbMATH DE number 3757713 (Why is no real title available?)
- scientific article; zbMATH DE number 3609145 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 3266647 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- Modifying the upper bound on the length of minimal synchronizing word
- On two Combinatorial Problems Arising from Automata Theory
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Shortest synchronizing strings for Huffman codes
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata preserving a chain of partial orders
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Synchronizing quasi-Eulerian and quasi-one-cluster automata
- The averaging trick and the Černý conjecture
- The Černý conjecture and 1-contracting automata
- The Černý conjecture for aperiodic automata
- The Černý conjecture for automata respecting intervals of a directed graph
- The Černý conjecture for one-cluster automata with prime length cycle
Cited in
(42)- The complexity of synchronizing Markov decision processes
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Slowly synchronizing automata with fixed alphabet size
- Černý's conjecture and the road colouring problem
- Sync-maximal permutation groups equal primitive permutation groups
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
- Synchronizing times for k-sets in automata
- Preimage problems for deterministic finite automata
- scientific article; zbMATH DE number 846959 (Why is no real title available?)
- Finding short synchronizing words for prefix codes
- Complexity of preimage problems for deterministic finite automata
- On randomized generation of slowly synchronizing automata
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- Synchronizing deterministic push-down automata can be really hard
- Semicomputable points in Euclidean spaces
- Attainable values of reset thresholds
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
- An improvement to a recent upper bound for synchronizing words of finite automata
- A note on a recent attempt to improve the Pin-Frankl bound
- Lower bounds for synchronizing word lengths in partial automata
- On the interplay between Černý and Babai's conjectures
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Synchronizing almost-group automata
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Synchronizing automata with coinciding cycles
- Synchronizing words under \textsf{LTL} constraints
- Fast synchronization of inhomogenous random automata
- Synchronizing deterministic push-down automata can be really hard
- On the smallest synchronizing terms of finite tree automata
- Reset sink complexity of regular ideals
- Short synchronizing words for random automata
- Subset mapping problems in solvable automata
- An improved algorithm for finding the shortest synchronizing words
- Careful synchronization of one-cluster automata
- A cornering strategy for synchronizing a DFA
- Synchronizing strongly connected partial DFAs
- Completely distinguishable automata and the set of synchronizing words
- A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
- The hereditariness problem for the Černý conjecture
- Synchronization of strongly connected partial DFAs and prefix codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304155)
