A package TESTAS for checking some kinds of testability

DOI10.1007/3-540-44977-9_22MaRDI QIDQ4418619zbMATH OpenFDO

Authors A. N. Trahtman

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.12583, http://link.springer.de/link/service/series/0558/bibs/2608/26080228.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• LANGAGE: A Maple package for automaton characterization of regular languages
• Reducing the time complexity of testing for local threshold testability
• Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
• Reducing the time complexity of testing for local threshold testability
• Piecewise and local threshold testability of DFA

Cited in

(13)

• Synchronizing finite automata with short reset words
• AUTOMATE, a computing package for automata and finite semigroups
• TESTAS
• LANGAGE: A Maple package for automaton characterization of regular languages
• Computing the shortest reset words of synchronizing automata
• Execution monitoring enforcement under memory-limitation constraints
• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
• COMPAS -- a computing package for synchronization
• GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
• Reducing the time complexity of testing for local threshold testability
• Groups synchronizing a transformation of non-uniform kernel
• Primitive groups synchronize non-uniform maps of extreme ranks
• scientific article; zbMATH DE number 1472161 (Why is no real title available?)

Describes a project that uses

Uses Software

• LANGAGE

This page was built for publication: A package TESTAS for checking some kinds of testability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418619)