scientific article

From MaRDI portal
Publication:2729242

zbMath0977.68055MaRDI QIDQ2729242

Jarkko Kari

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 semigroupSome results concerning careful synchronization of partial automata and subset synchronization of DFA'sPrimitive digraphs with large exponents and slowly synchronizing automataSynchronizing automata with coinciding cyclesImage reducing words and subgroups of free groups.Lower Bounds for Synchronizing Word Lengths in Partial AutomataSynchronizing Automata and the Černý ConjectureSynchronizationA Linear Bound on the k-rendezvous Time for Primitive Sets of NZ MatricesFinding DFAs with Maximal Shortest Synchronizing Word LengthSynchronizing generalized monotonic automataSynchronizing monotonic automataČerný's conjecture and group representation theoryThe Černý conjecture for one-cluster automata with prime length cycleSynchronizing groups and automataOn the Synchronizing Probability Function and the Triple Rendezvous TimeCOMPAS - A Computing Package for SynchronizationSlowly synchronizing automata with fixed alphabet sizeOn the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing AutomataSynchronizing finite automata with short reset wordsPrimitive and irreducible automataExtremal synchronizing circular automataModifying the Upper Bound on the Length of Minimal Synchronizing WordMatrix Mortality and the Černý-Pin ConjectureA Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster AutomataExperiments with Synchronizing AutomataČerný's conjecture and the road colouring problemNotable trends concerning the synchronization of graphs and automata