Publication:2729242
From MaRDI portal
zbMath0977.68055MaRDI QIDQ2729242
Publication date: 29 January 2002
68Q45: Formal languages and automata
Related Items
A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices, Lower Bounds for Synchronizing Word Lengths in Partial Automata, Finding DFAs with Maximal Shortest Synchronizing Word Length, Primitive digraphs with large exponents and slowly synchronizing automata, Synchronizing monotonic automata, The Černý conjecture for one-cluster automata with prime length cycle, Primitive and irreducible automata, Synchronization, Synchronizing finite automata with short reset words, Image reducing words and subgroups of free groups., Synchronizing generalized monotonic automata, Slowly synchronizing automata with fixed alphabet size, Extremal synchronizing circular automata, Černý's conjecture and the road colouring problem, Černý's conjecture and group representation theory, Reaching the minimum ideal in a finite semigroup, Synchronizing groups and automata, On the Synchronizing Probability Function and the Triple Rendezvous Time, On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata, Experiments with Synchronizing Automata, COMPAS - A Computing Package for Synchronization, Modifying the Upper Bound on the Length of Minimal Synchronizing Word, Notable trends concerning the synchronization of graphs and automata, Synchronizing Automata and the Černý Conjecture, Matrix Mortality and the Černý-Pin Conjecture, A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
