Results 1  10
of
36
Checking NFA equivalence with bisimulations up to congruence
"... Abstract—We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [12] that, instead of computing the whole determinised automa ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
automata, explores only a small portion of it. Although the optimised algorithm remains exponential in worst case (the problem is PSPACEcomplete), experimental results show improvements of several orders of magnitude over the standard algorithm. I.
IOS Press Results on Transforming NFA into DFCA ∗
"... Abstract. In this paper we consider the transformation from (minimal) Nondeterministic Finite Automata (NFAs) to Deterministic Finite Cover Automata (DFCAs). We want to compare the two equivalent accepting devices with respect to their number of states; this becomes in fact a comparison between the ..."
Abstract
 Add to MetaCart
of a binary alphabet. We show, for such binary alphabets, that the difference between maximum blowup state complexity of DFA and DFCA can be as small as 2 ⌈ n 2 ⌉−2 compared to the number of states of the minimal DFA. Moreover, we show the structure of automata for worst case exponential blow
Partial Derivatives of Regular Expressions and Finite Automata Constructions
 Theoretical Computer Science
, 1995
"... . We introduce a notion of a partial derivative of a regular expression. It is a generalization to the nondeterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski's algorithm constructing DFA. We report on a prototype implementation of our algorithm constructing NFA and present some examples. Introduction In 1964 Janusz Brzozowski
The minimum consistent DFA problem cannot be approximated within any polynomial
 Journal of the Association for Computing Machinery
, 1993
"... Abstract. The minimum consistent DFA problem is that of finding a DFA with as few states as possible that is consistent with a given sample (a finite collection of words, each labeled as to whether the DFA found should accept or reject). Assuming that P # NP, it is shown that for any constant k, no ..."
Abstract

Cited by 99 (4 self)
 Add to MetaCart
, no polynomialtime algorithm can be guaranteed to find a consistent DFA with fewer than opt ~ states, where opt is the number of states in the minimum state DFA consistent with the sample. This result holds even if the alphabet is of constant size two, and if the algorithm is allowed to produce an NFA, a
Translating Regular Expressions into Small epsilonFree Nondeterministic Finite Automata
 In STACS 97, Lecture Notes in Computer Science
, 1997
"... . It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n) 2 ) in polynomial time. The best previous conversions result in NFAs of worst case size \Theta(n 2 ). Moreover, the nonexistence of any linear con ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
. It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n) 2 ) in polynomial time. The best previous conversions result in NFAs of worst case size \Theta(n 2 ). Moreover, the nonexistence of any linear
Computing Small Nondeterministic Finite Automata
 Proc. Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Dept. of CS, Univ. of Aarhus
, 1995
"... We study the minimization problem for nondeterministic finite automata. Two approaches are discussed, based on the construction of two versions of "canonical" automata (for a given regular language), in which minimal automata occur as subautomata. We introduce a heuristic for this search, ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
, which has been implemented in the program AMoRE. Introduction Minimization of nondeterministic finite automata ("NFA") is more difficult than that of deterministic finite automata. The problem is PSPACEcomplete (except for the case of oneletteralphabets) [6], whereas deterministic finite
Small NFAs from regular expressions: some experimental results,”
 in Proceedings of the 6th Conference on Computability in Europe (CIE '10),
, 2010
"... Abstract. Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata (NFA). We present the implementati ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the implementation of several algorithms for constructing small εfree NFAs from REs within the FAdo system, and a comparison of regular expression measures and NFA sizes based on experimental results obtained from uniform random generated REs. For this analysis, nonredundant REs and reduced REs in star normal form
HighResolution CT Findings in Patients With NearFatal Asthma* Comparison of Patients With MildtoSevere Asthma and Normal Control Subjects and Changes
"... Study objectives: Extensive airway inflammation and excessive mucus production are implicated in deaths from asthma. Highresolution CT (HRCT) can be used to image both large and small airway abnormalities in asthmatics. The aims of this study were to clarify the distinction of HRCT features between ..."
Abstract
 Add to MetaCart
between nearfatal asthma (NFA) and nonNFA, and to evaluate serial followup HRCT scans of patients with NFA. Patients and design: Abnormalities of the large airway (bronchial wall thickness) and small airways (prominence of centrilobular structures and air trapping) were measured semiquantitatively
Deflating the Big Bang: Fast and Scalable Deep Packet Inspection with Extended Finite Automata
"... Deep packet inspection is playing an increasingly important role in the design of novel network services. Regular expressions are the language of choice for writing signatures, but standard DFA or NFA representations are unsuitable for highspeed environments, requiring too much memory, too much tim ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
Deep packet inspection is playing an increasingly important role in the design of novel network services. Regular expressions are the language of choice for writing signatures, but standard DFA or NFA representations are unsuitable for highspeed environments, requiring too much memory, too much
Journal of Clinical Endocrinology and Metabolism Printed in U.S.A. Copyright © 1997 by The Endocrine Society Dissociation between the Effects of Somatostatin (SS) and Octapeptide SSAnalogs on Hormone Release in a Small Subgroup of Pituitary and Islet Ce
"... The effects of somatostatin (SS14 and/or SS28) and of the three octapeptide SSanalogs that are available for clinical use (octreotide, BIM23014 and RC160) on hormone release by primary cultures of 15 clinically nonfunctioning pituitary adenomas (NFA), 7 prolactinomas, and 2 insulinomas were inv ..."
Abstract
 Add to MetaCart
The effects of somatostatin (SS14 and/or SS28) and of the three octapeptide SSanalogs that are available for clinical use (octreotide, BIM23014 and RC160) on hormone release by primary cultures of 15 clinically nonfunctioning pituitary adenomas (NFA), 7 prolactinomas, and 2 insulinomas were
Results 1  10
of
36