Results 1 to 10 of about 75,545 (125)

Incremental DFA minimisation [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 2011
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance.
Marco Almeida   +2 more
openaire   +1 more source

A-DFA [PDF]

open access: yesACM 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

Sequential drain amylase to guide drain removal following pancreatectomy [PDF]

open access: yes, 2018
BACKGROUND: Although used as criterion for early drain removal, postoperative day (POD) 1 drain fluid amylase (DFA) ≤ 5000 U/L has low negative predictive value for clinically relevant postoperative pancreatic fistula (CR-POPF).
Dillhoff, M.   +15 more
core   +2 more sources

Transition Complexity of Incomplete DFAs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
We consider the transition complexity of regular languages based on the incomplete deterministic finite automata. We establish tight bounds for the transition complexity of Boolean operations, in the case of union the upper and lower bounds differ by a multiplicative constant two.
Yuan Gao, Kai Salomaa, Sheng Yu
openaire   +4 more sources

Learning DFA from Simple Examples [PDF]

open access: yesMachine Learning, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parekh, Rajesh, Honavar, Vasant
openaire   +2 more sources

A study on the possible usefulness of detrended fluctuation analysis of the electroencephalogram background activity in Alzheimer's disease [PDF]

open access: yes, 2008
We studied the EEG background activity of Alzheimer's disease (AD) patients with detrended fluctuation analysis (DFA). DFA provides an estimation of the scaling information and long-range correlations in time series. We recorded the EEG in 11 AD patients
Abasolo, Daniel   +3 more
core   +2 more sources

Multifractal detrended fluctuation analysis of nonstationary time series [PDF]

open access: yes, 2002
We develop a method for the multifractal characterization of nonstationary time series, which is based on a generalization of the detrended fluctuation analysis (DFA).
Alados   +50 more
core   +2 more sources

Theory of Atomata [PDF]

open access: yes, 2013
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "\'atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or uncomplemented left quotients of ...
Brzozowski, Janusz, Tamm, Hellis
core   +2 more sources

$$L^{\#}$$ for DFAs [PDF]

open access: yes
Contains fulltext : 316736.pdf (Publisher’s version ) (Open Access)
Frits Vaandrager, Martijn Sanders
openaire   +1 more source

Two-dimensional matrix algorithm using detrended fluctuation analysis to distinguish Burkitt and diffuse large B-cell lymphoma [PDF]

open access: yes, 2012
Copyright © 2012 Rong-Guan Yeh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.A ...
Abbod, MF   +3 more
core   +3 more sources

Home - About - Disclaimer - Privacy