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