TY - JOUR
T1 - A package TESTAS for checking some kinds of testability
AU - Trahtman, A. N.
PY - 2003
Y1 - 2003
N2 - We implement a set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semi-group is locally testable, right or left locally testable, threshold locally testable, strictly locally testable, or piecewise testable. The bounds on order of local testability of transition graph and order of local testability of transition semigroup are also found. For given k, the k-testability of transition graph is verified. Some new effective polynomial time algorithms are used. These algorithms have been implemented as a C/C++ package.
AB - We implement a set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semi-group is locally testable, right or left locally testable, threshold locally testable, strictly locally testable, or piecewise testable. The bounds on order of local testability of transition graph and order of local testability of transition semigroup are also found. For given k, the k-testability of transition graph is verified. Some new effective polynomial time algorithms are used. These algorithms have been implemented as a C/C++ package.
UR - http://www.scopus.com/inward/record.url?scp=35248890041&partnerID=8YFLogxK
U2 - 10.1007/3-540-44977-9_22
DO - 10.1007/3-540-44977-9_22
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35248890041
SN - 0302-9743
VL - 2608
SP - 228
EP - 232
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -