4 citations · 4 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021
A package TESTAS for checking some kinds of testability
A. N. Trahtman
We implement a set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semigroup is locally testable, right or left locally test…
cs.FL2021★ 4 cited
The Černy Conjecture for aperiodic automata
A. N. Trahtman
A word w is called a synchronizing (recurrent, reset) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some state; a DFA that has a synchro…