TESTAS
From MaRDI portal
Cited in
(25)- Implementation and application of automata. 7th international conference, CIAA 2002, Tours, France, July 3--5, 2002. Revised papers
- Experiments with Synchronizing Automata
- COMPAS -- a computing package for synchronization
- Černý's conjecture and group representation theory
- Synchronizing finite automata with short reset words
- The Černý conjecture for one-cluster automata with prime length cycle
- An algorithm for road coloring
- Execution monitoring enforcement under memory-limitation constraints
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- AUTOMATE
- COMPAS
- LANGAGE
- Vaucanson
- automata
- LANGAGEA
- Semigroupe
- AMoRE
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Computing the shortest reset words of synchronizing automata
- Reducing the time complexity of testing for local threshold testability
- Reducing the time complexity of testing for local threshold testability
- A partially synchronizing coloring
- An algorithm for road coloring
- Matrix Mortality and the Černý-Pin Conjecture
- Finding DFAs with maximal shortest synchronizing word length
This page was built for software: TESTAS
