scientific article
From MaRDI portal
Publication:3304155
DOI10.4230/LIPIcs.STACS.2018.56zbMath1440.68164arXiv1702.05455MaRDI QIDQ3304155
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1702.05455
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
synchronizing wordreset wordsynchronizing automatonavoiding wordČerny conjecturereset thresholdreset length
Related Items (28)
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Synchronizing times for \(k\)-sets in automata ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Preimage problems for deterministic finite automata ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ On the Interplay Between Černý and Babai’s Conjectures ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ The complexity of synchronizing Markov decision processes ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number ⋮ Unnamed Item ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Semicomputable points in Euclidean spaces ⋮ Černý's conjecture and the road colouring problem ⋮ Attainable Values of Reset Thresholds ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices ⋮ Synchronizing Almost-Group Automata ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture and 1-contracting automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Shortest synchronizing strings for Huffman codes
- Synchronizing automata preserving a chain of partial orders
- A series of slowly synchronizing automata with a zero state over a small alphabet
- An extremal problem for two families of sets
- Reset words for commutative and solvable automata
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Algebraic synchronization criterion and computing reset words
- Experiments with Synchronizing Automata
- THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Approximation of Reset Thresholds with Greedy Algorithms
- SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA
This page was built for publication:
