scientific article; zbMATH DE number 5279401
From MaRDI portal
Publication:5387708
zbMath1152.68461arXiv2105.09105MaRDI QIDQ5387708
Publication date: 27 May 2008
Full work available at URL: https://arxiv.org/abs/2105.09105
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Synchronizing automata preserving a chain of partial orders ⋮ Strongly connected synchronizing automata and the language of minimal reset words ⋮ The Černý conjecture and 1-contracting automata ⋮ Unnamed Item ⋮ The annulation threshold for partially monotonic automata ⋮ The Synchronization Problem for Locally Strongly Transitive Automata ⋮ Synchronizing Automata of Bounded Rank ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Groups synchronizing a transformation of non-uniform kernel ⋮ Primitive groups synchronize non-uniform maps of extreme ranks ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Synchronizing automata with coinciding cycles ⋮ Synchronizing Automata Preserving a Chain of Partial Orders ⋮ On primitivity of sets of matrices ⋮ Primitive groups, graph endomorphisms and synchronization ⋮ Synchronizing sequences for road colored digraphs ⋮ Preimage problems for deterministic finite automata ⋮ Recent results on syntactic groups of prefix codes. ⋮ The Synchronization Problem for Strongly Transitive Automata ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Surface Dimension, Tiles, and Synchronizing Automata ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ Synchronization ⋮ A series of slowly synchronizing automata with a zero state over a small alphabet ⋮ Černý conjecture for edge-colored digraphs with few junctions ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number ⋮ Černý's conjecture and group representation theory ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ Analytic methods for reachability problems ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Extremal synchronizing circular automata ⋮ An Extremal Series of Eulerian Synchronizing Automata ⋮ Modifying the Upper Bound on the Length of Minimal Synchronizing Word ⋮ Matrix Mortality and the Černý-Pin Conjecture ⋮ Strongly transitive automata and the Černý conjecture ⋮ Sync-maximal permutation groups equal primitive permutation groups
This page was built for publication:
