Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Graph-Grammars and Their Application to Computer Science
Graph-Grammars and Their Application to Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Piecewise and Local Threshold Testability of DFA
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science - Implementation and application of automata
Execution monitoring enforcement under memory-limitation constraints
Information and Computation
Execution monitoring enforcement for limited-memory systems
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
A polynomial time algorithm for left [right] local testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Reducing the time complexity of testing for local threshold testability
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Effective characterizations of simple fragments of temporal logic using prophetic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 14.98 |
The local testability problem of deterministic finite automata is investigated. A locally testable language is a language with the property that, for some nonnegative integer k, whether or not a word w is in the language depends on (1) the prefix and suffix of w of length k, and (2) the set of substrings of w length k+1, without regard to the order in which these substrings occur. The local testability problem is, given a deterministic finite automation, to decide whether or not it accepts a locally testable language. The authors present an O(n/sup 2/) time algorithm for the local testability problem based on two simple properties that characterize locally testable automata.