Results 11 to 20 of about 29,290 (288)
Families of DFAs as Acceptors of $\omega$-Regular Languages [PDF]
Logical Methods in Computer Science, 2018 Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the ...
Dana Angluin, Udi Boker, Dana Fisman
doaj +3 more sources
Molecules, 2008 Di-D-fructose dianhydrides (DFAs) comprise a unique family of stereoisomeric spiro-tricyclic disaccharides formed upon thermal and/or acidic activation of sucroseand/ or D-fructose-rich materials.
José M. GarcÃÂa Fernández +3 more
doaj +2 more sources
Computing matching statistics on Wheeler DFAs [PDF]
2023 Data Compression Conference (DCC), 2023 Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPIRE 2010] proposed a time and space efficient algorithm for computing matching statistics which relies on some components of a compressed suffix tree - notably, the longest ...
Conte A. +5 more
openaire +7 more sources
Difructose Dianhydrides (DFAs) and DFA-Enriched Products as Functional Foods
Topics in current chemistry, 2010 This review provides an overview of the current status of the chemistry and biology of di-D-fructose dianhydrides (DFAs) with a focus on their potential as functional foods. The history of this family of cyclic ketodisaccharides has expanded for almost 100 years and offers a paradigmatic example of artificial synthetic molecules that were identified as
Ortiz-Mellet, Carmen +1 more
openaire +4 more sources
Prefix Sorting DFAs: a Recursive Algorithm [PDF]
International Symposium on Algorithms and Computation, 2023 In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in $ O(m^2 + n^{5/2}) $ time, where $ n $ is the number of states and $ m $ is the number of edges [SODA 2021].
Nicola Cotumaccio
openaire +5 more sources
Performance of various density-functional approximations for cohesive properties of 64 bulk solids
New Journal of Physics, 2018 Accurate and careful benchmarking of different density-functional approximations (DFAs) represents an important source of information for understanding DFAs and how to improve them.
Guo-Xu Zhang +3 more
doaj +2 more sources
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Champarnaud, Jean-Marc +1 more
openaire +2 more sources
DFAMiner: Mining Minimal Separating DFAs from Labelled Samples [PDF]
World Congress on Formal MethodsWe propose DFAMiner, a passive learning tool for learning minimal separating deterministic finite automata (DFA) from a set of labelled samples. Separating automata are an interesting class of automata that occurs generally in regular model checking and ...
Daniele Dell’Erba +2 more
openalex +2 more sources
Space-time Trade-offs for the LCP Array of Wheeler DFAs [PDF]
SPIRE, 2023 Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to efficiently determine matching statistics on a Wheeler DFA [DCC 2023]. However, storing the LCP array requires O
Nicola Cotumaccio +3 more
semanticscholar +1 more source
Linear-time Minimization of Wheeler DFAs [PDF]
Data Compression Conference, 2021 Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata, WDFAs can be stored in just $\log\sigma+O(1)$ bits per edge, $\sigma ...
Jarno N. Alanko +2 more
semanticscholar +1 more source