8 citations · 17 across the 11 of their papers we have counts for
Showing 2022 · cs.FLShow all
3 papers · 2 filters
cs.FL2022
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…
cs.FL2022
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…
cs.FL2022
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…