The following pages link to TESTAS (Q13701):
Displaying 15 items.
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Implementation and application of automata. 7th international conference, CIAA 2002, Tours, France, July 3--5, 2002. Revised papers (Q1397208) (← links)
- An algorithm for road coloring (Q1932365) (← links)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- An Algorithm for Road Coloring (Q3111663) (← links)
- Reducing the Time Complexity of Testing for Local Threshold Testability (Q3559782) (← links)
- A Partially Synchronizing Coloring (Q3569761) (← links)
- Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
