Pages that link to "Item:Q3674065"
From MaRDI portal
The following pages link to On two Combinatorial Problems Arising from Automata Theory (Q3674065):
Displaying 50 items.
- The Černý conjecture and 1-contracting automata (Q311503) (← links)
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Synchronizing random automata on a 4-letter alphabet (Q376130) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- The road coloring problem (Q731355) (← links)
- Geometrical solution of an intersection problem for two hypergraphs (Q798334) (← links)
- Extremal binary PFAs in a Černý family (Q832924) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- A lower bound for the length of the shortest carefully synchronizing words (Q845082) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- Synchronizing finite automata on Eulerian digraphs. (Q1401241) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Some contributions to the theory of transformation monoids (Q1712470) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time (Q2799174) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- Synchronizing Automata on Quasi-Eulerian Digraph (Q2914697) (← links)
- Synchronizing Automata of Bounded Rank (Q2914705) (← links)
- Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
- Primitive groups, graph endomorphisms and synchronization (Q2960608) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word (Q3088281) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q3304155) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Shortest Synchronizing Strings for Huffman Codes (Q3599120) (← links)
- Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
