Open AccessJournal Article
An algorithm to verify local threshold testability of deterministic finite automata
TLDR
In this paper, the necessary and sufficient conditions for an automaton to be locally threshold testable are found, and the first polynomial time algorithm to verify local threshold testability of the automaton based on this characterization is introduced.Abstract:
A locally threshold testable language L is a language with the property that for some nonnegative integers k and l, whether or not a word u is 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 where the sets of substrings occurring at least j times are the same, for j < l. For given k and I the language is called l-threshold k-testable. A finite deterministic automaton is called l-threshold k-testable if the automaton accepts a l-threshold k-testable language. In this paper, the necessary and sufficient conditions for an automaton to be locally threshold testable are found. We introduce the first polynomial time algorithm to verify local threshold testability of the automaton based on this characterization. New version of polynomial time algorithm to verify the local testability will be presented too.read more
Citations
More filters
Journal ArticleDOI
Execution monitoring enforcement under memory-limitation constraints
TL;DR: A new class of automata is introduced, bounded history automata, to represent execution monitors constrained by memory limitations, to define a precise taxonomy of security policies that are enforceable under memory-limitation constraints.
Journal ArticleDOI
Which security policies are enforceable by runtime monitors? A survey
Raphaël Khoury,Nadia Tawbi +1 more
TL;DR: This survey examines the evolution of knowledge regarding the issue of precisely which security policies monitors are capable of enforcing, and identifies three stages in this evolution.
Journal ArticleDOI
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
Thomas Place,Marc Zeitoun +1 more
TL;DR: In this article, the authors investigated quantifier alternation hierarchies in first-order logic on finite words and proved that one can decide membership of a regular language in the levels BΣ2 (finite Boolean combinations of formulas having only one alternation) and Σ3 (formulas having only two alternations and beginning with an existential block).
Proceedings ArticleDOI
A package TESTAS for checking some kinds of testability
TL;DR: A set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semigroup is locally testable, right or left locally test able, threshold locally testables, strictly locally testability, or piecewise testable is implemented.
Proceedings ArticleDOI
Execution monitoring enforcement for limited-memory systems
TL;DR: This work introduces a new class of automata that is called Bounded History Automata, and gives rise to a realistic evaluation of the enforcement power of execution monitoring, based on bounding the memory size used by the monitor to save execution history, and identifying the security policies enforceable under such constraint.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book
Counter-Free Automata
Robert McNaughton,Seymour Papert +1 more
TL;DR: A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class.
Journal ArticleDOI
Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.
TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.
Journal ArticleDOI
Classifying regular events in symbolic logic
TL;DR: It is shown that the natural classification of events depending on these quantifiers will not yield on infinite hierarchy, and that the latter two hierarchies have appealing characterizations in symbolic logic.