Publication:5387708

From MaRDI portal


zbMath1152.68461arXiv2105.09105MaRDI QIDQ5387708

A. N. Trahtman

Publication date: 27 May 2008

Full work available at URL: https://arxiv.org/abs/2105.09105


68Q45: Formal languages and automata


Related Items

Unnamed Item, Synchronization problems in automata without non-trivial cycles, The Černý conjecture and 1-contracting automata, Groups synchronizing a transformation of non-uniform kernel, Primitive groups synchronize non-uniform maps of extreme ranks, Recent results on syntactic groups of prefix codes., Černý conjecture for edge-colored digraphs with few junctions, The Černý conjecture for one-cluster automata with prime length cycle, Synchronizing automata preserving a chain of partial orders, The annulation threshold for partially monotonic automata, On primitivity of sets of matrices, Synchronization, A series of slowly synchronizing automata with a zero state over a small alphabet, Strongly transitive automata and the Černý conjecture, Strongly connected synchronizing automata and the language of minimal reset words, A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, Analytic methods for reachability problems, Extremal synchronizing circular automata, Synchronizing sequences for road colored digraphs, Preimage problems for deterministic finite automata, A multi-parameter analysis of hard problems on deterministic finite automata, Černý's conjecture and group representation theory, On the Synchronizing Probability Function and the Triple Rendezvous Time, On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata, An Extremal Series of Eulerian Synchronizing Automata, Synchronizing Automata of Bounded Rank, Primitive groups, graph endomorphisms and synchronization, Modifying the Upper Bound on the Length of Minimal Synchronizing Word, Unnamed Item, The Synchronization Problem for Locally Strongly Transitive Automata, Surface Dimension, Tiles, and Synchronizing Automata, Synchronizing Automata Preserving a Chain of Partial Orders, The Synchronization Problem for Strongly Transitive Automata, Synchronizing Automata and the Černý Conjecture, Matrix Mortality and the Černý-Pin Conjecture