Results 21 to 30 of about 29,290 (288)
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs
International Colloquium on Automata, Languages and Programming, 2022 We present an algorithm that constructs a deterministic Büchi automaton in polynomial time from given sets of positive and negative example words. This learner constructs multiple DFAs using a polynomial-time active learning algorithm on finite words as ...
Leon Bohn, Christof Löding
semanticscholar +1 more source
Rational design of the genetic code expansion toolkit for in vivo encoding of D-amino acids
Frontiers in Genetics, 2023 Once thought to be non-naturally occurring, D-amino acids (DAAs) have in recent years been revealed to play a wide range of physiological roles across the tree of life, including in human systems.
Han-Kai Jiang +15 more
doaj +1 more source
ACM Transactions on Architecture and Code Optimization, 2013 Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. While Deterministic Finite Automata (DFAs) allow this operation to be performed in linear time, they may exhibit prohibitive memory requirements. Kumar et al.
Michela Becchi, Patrick Crowley
openaire +1 more source
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees [PDF]
International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2016 In this paper, we propose a novel algorithm to learn a Buchi automaton from a teacher who knows an \(\omega \)-regular language. The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman [10]. The
Yong Li +3 more
semanticscholar +1 more source
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2014 The study of graph products is a major research topic and typically concerns the term f(G * H), e.g., to show that f(G * H) = f(G)f(H). In this paper, we study graph products in a non-standard form f(R[G * H]) where R is a “reduction”, a transformation ...
Parinya Chalermsook +2 more
semanticscholar +1 more source
Frontiers in Bioengineering and Biotechnology, 2022 Background: The complexity of the spatial dynamic flexion axis (DFA) of the elbow joint makes the elbow prosthesis design and humeral component alignment challenging.
Diyang Zou +11 more
doaj +1 more source
An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata
South African Computer Journal, 2017 Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs). Four algorithms that convert arbitrary DFAs to language-equivalent FDFAs are empirically investigated.
Madoda Nxumalo +3 more
doaj +1 more source
Learning DFA from Simple Examples [PDF]
Machine Learning, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parekh, Rajesh, Honavar, Vasant
openaire +2 more sources
BMC Nursing, 2023 Background Mealtime difficulties related to cognitive functioning negatively impact a patient’s life during the various stages of dementia, and they typically cause a burden and stress on family caregivers. Most people with dementia live at home alone or
Mei-Yin Liu +4 more
doaj +1 more source
Automatic Search of Meet-in-the-Middle Differential Fault Analysis on AES-like Ciphers
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Fault analysis is a powerful technique to retrieve secret keys by exploiting side-channel information. Differential fault analysis (DFA) is one of the most powerful threats utilizing differential information between correct and faulty ciphertexts and ...
Qingyuan Yu +6 more
doaj +1 more source