Results 11 to 20 of about 51,114 (288)
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. N. Trahtman
semanticscholar +4 more sources
Detecting a single fault in a deterministic finite automaton [PDF]
, 2021 Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.
Artur Polański, Eryk Lipka
openalex +3 more sources
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 +4 more sources
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 +4 more sources
State Elimination Ordering Strategies: Some Experimental Results [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case.
Nelma Moreira +2 more
doaj +4 more sources
A Predict Deterministic Finite Automaton for Practical Deep Packet Inspection
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
Qiang Wei, Yunzhao Li, Yanjie Chu
openalex +2 more sources
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +4 more sources
Packet Payload Monitoring for Internet Worm Content Detection Using Deterministic Finite Automaton with Delayed Dictionary Compression [PDF]
Journal of Computer Networks and Communications, 2014 Packet content scanning is one of the crucial threats to network security and network monitoring applications. In monitoring applications, payload of packets in a network is matched against the set of patterns in order to detect attacks like worms, viruses, and protocol definitions.
Selvaraj Divya, G. Padmavathi
openalex +4 more sources
Journal of Science, Engineering and Technology (JSET), 2018 The study designed and developed a finite state machine generator which converts a regular expression to its equivalent non-deterministic finite automaton with -moves ( − NF A). It implements Thompson’s construction algorithm, an algorithm that works recursively by splitting an expression into its constituent subexpressions, from which the − NF A will
Gilbert M. Arces +3 more
openalex +2 more sources
Safe reinforcement learning under temporal logic with reward design and quantum action selection [PDF]
Scientific Reports, 2023 This paper proposes an advanced Reinforcement Learning (RL) method, incorporating reward-shaping, safety value functions, and a quantum action selection algorithm. The method is model-free and can synthesize a finite policy that maximizes the probability
Mingyu Cai +3 more
doaj +2 more sources