Results 11 to 20 of about 1,535,797 (279)
Non-Deterministic Finite Cover Automata [PDF]
Scientific Annals of Computer Science, 2015 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
C. Câmpeanu
doaj +3 more sources
A Predict Deterministic Finite Automaton for Practical Deep Packet Inspection [PDF]
Procedia Engineering, 2012 AbstractDeep packet inspection has become extremely important due to network security. In deep packet inspection, the packet payload is compared against a set of patterns specified as regular expressions. Regular expressions are often implemented as deterministic finite automaton (DFA) for matching in linear time at high network link rates. We proposed
Wei, Qiang, Li, Yunzhao, Chu, Yanjie
openaire +2 more sources
Acta InformaticaAbstract Given a deterministic finite automaton (DFA) A, we present a simple algorithm for constructing deterministic finite automata that accept the shortest forbidden factors, the shortest forbidden prefixes, the shortest forbidden suffixes, the shortest forbidden words, the shortest allowed suffixes, and the shortest allowed words of the ...
Jan Janoušek, Štěpán Plachý
openaire +4 more sources
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automaton [PDF]
, 1983 We show that string-matching cannot be performed by a two-head one-way deterministic finite automaton (or even by a Turing machine with two one-way input heads and o(n) storage space). Thus we answer the special case $k=2$ of the open question, due to
Li, Ming, Yesha, Yaacov
core +6 more sources
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine [PDF]
, 2008 A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components.
Ipate, F, Hierons, RM
core +6 more sources
Representing Small Ordinals by Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj +1 more source
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees.
Christof Löding, Sarah Winter
doaj +1 more source
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al.
Marco Almeida +2 more
doaj +1 more source
Learning Cover Context-Free Grammars from Structural Data [PDF]
Scientific Annals of Computer Science, 2014 We consider the problem of learning an unknown context-free gram- mar from its structural descriptions with depth at most ℓ. The structural descriptions of the context-free grammar are its unlabelled derivation trees. The goal is to learn a cover context-
M. Marin, G. Istrate
doaj +1 more source
DLIQ: A Deterministic Finite Automaton Learning Algorithm through Inverse Queries
Information Technology and Control, 2022 Automaton learning has attained a renewed interest in many interesting areas of software engineering including formal verification, software testing and model inference. An automaton learning algorithm typically learns the regular language of a DFA with the help of queries.
Farah Haneef, Muddassar A. Sindhu
openaire +1 more source