The following pages link to A. N. Trahtman (Q594199):
Displaying 27 items.
- The varieties of n-testable semigroups (Q594200) (← links)
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- The road coloring problem (Q731355) (← links)
- Covering elements in the lattice of varieties of algebras (Q1239341) (← links)
- A variety of semigroups without an irreducible basis for identities (Q1254377) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- An algorithm for road coloring (Q1932365) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word (Q3088281) (← links)
- An Algorithm for Road Coloring (Q3111663) (← links)
- Notable trends concerning the synchronization of graphs and automata (Q3439497) (← links)
- A Partially Synchronizing Coloring (Q3569761) (← links)
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL (Q3839881) (← links)
- (Q4081493) (← links)
- (Q4148160) (← links)
- (Q4418616) (← links)
- (Q4418619) (← links)
- (Q4474160) (← links)
- (Q4548273) (← links)
- Identities of locally testable semigroups (Q4700477) (← links)
- (Q4782722) (← links)
- (Q5249242) (← links)
- Some New Features and Algorithms for the Study of DFA (Q5350465) (← links)
- (Q5387708) (← links)
- Synchronization of Some DFA (Q5425436) (← links)
- (Q5592301) (← links)
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture (Q5756675) (← links)
