TESTAS
From MaRDI portal
Software:13701
No author found.
Related Items (18)
An algorithm for road coloring ⋮ Implementation and application of automata. 7th international conference, CIAA 2002, Tours, France, July 3--5, 2002. Revised papers ⋮ Complexity of road coloring with prescribed reset words ⋮ Reducing the Time Complexity of Testing for Local Threshold Testability ⋮ A Partially Synchronizing Coloring ⋮ Execution monitoring enforcement under memory-limitation constraints ⋮ Finding DFAs with Maximal Shortest Synchronizing Word Length ⋮ Reducing the time complexity of testing for local threshold testability ⋮ Černý's conjecture and group representation theory ⋮ An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ COMPAS - A Computing Package for Synchronization ⋮ Synchronizing finite automata with short reset words ⋮ Matrix Mortality and the Černý-Pin Conjecture ⋮ Experiments with Synchronizing Automata ⋮ An Algorithm for Road Coloring ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices ⋮ Computing the shortest reset words of synchronizing automata
This page was built for software: TESTAS
