8 citations · 17 across the 11 of their papers we have counts for
13 papers
A Partially Synchronizing Coloring
A. N. Trahtman
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet…
A polynomial time algorithm for local testability and its level
A. N. Trahtman
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set o…
Row monomial matrices and Černy conjecture, short proof
A. N. Trahtman
The class of row monomial matrices (one unit and rest zeros in every row) with some non-standard operations of summation and usual multiplication is our main object. These matrices…
The algebra of row monomial matrices
A. N. Trahtman
We consider an algebra with non-standard operations on the class of row monomial matrices (having one unit and rest of zeros in every row). The class of row monomial matrices is cl…
Verification Tools for Checking some kinds of Testability
A. N. Trahtman
A locally testable language L is a language with the property that for some non negative integer k, called the order of local testability, whether or not a word u is in the languag…
An algorithm to verify local threshold testability of deterministic finite automata
A. N. Trahtman
A locally threshold testable language L is a language with the property that for some non negative integers k and l, whether or not a word u is in the language L depends on (1) the…