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