Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science - Implementation and application of automata
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
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
Reducing the time complexity of testing for local threshold testability
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
| Hi-index | 0.00 |
A locally testable language is a language with the property that, for some positive integer $j$, whether or not a string $x$ is in the language depends on (1) the prefix and suffix of $x$ of length $j - 1$, and (2) the set of substrings of x of length $j$, without regard to the order in which these substrings occur or the number of times each substring occurs. For any $j$ for which this is true, it is said that the language is $j$-testable. For a given locally testable language, the smallest such number $j$ is called the order of the language. Locally testable languages are regular and therefore these concepts apply to the finite automata that recognize the languages. The authors show that computing the order of a given locally testable deterministic automaton is NP-hard and present a polynomial-time $\epsilon$-approximation algorithm for computing it. In addition, an upper bound of $2n^2 +1$ on the order of a locally testable automaton of $n$ states is obtained, and the co-NP-completeness of the problem of whether, for a given $j$, a given deterministic automaton is $j$-testable is proven.