4 citations · 4 across the 4 of their papers we have counts for
4 papers
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…
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…
A Note on a Recent Attempt to Improve the Pin-Frankl Bound
François Gonze, Raphaël M. Jungers, A. N. Trahtman
We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate a…
An Algorithm for Road Coloring
A. N. Trahtman
A coloring of edges of a finite directed graph turns the graph into finite-state automaton. The synchronizing word of a deterministic automaton is a word in the alphabet of colors…