Paper Info
Title
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton
Abstract
A locally testable language L is a language with the property that for some nonnegative integer k, called the order or the level of local testability, whether or not a word u in the language L depends on (1) the prefix and suffix of the word u of length k - 1 and (2) the set of intermediate substrings of length k of the word u. For given k the language is called k-testable.
Year
DOI
Venue
1997
10.1007/BFb0031393
Workshop on Implementing Automata
Keywords
Field
DocType
Precise Estimation,Local Testability,Deterministic Finite Automaton
Testability,Discrete mathematics,Combinatorics,Two-way deterministic finite automaton,Nondeterministic finite automaton,Deterministic automaton,Deterministic finite automaton,Powerset construction,Prefix,Mathematics,Büchi automaton
Conference
Volume
ISSN
ISBN
1436
0302-9743
3-540-64694-9
Citations 
PageRank 
References 
3
0.47
10
Authors
1
Name
Order
Citations
PageRank
A. N. Trahtman19211.68