Results 1  10
of
10
Grail: A C++ Library for Automata and Expressions
 JOURNAL OF SYMBOLIC COMPUTATION
, 1995
"... ..."
Subset construction complexity for homogeneous automata, position automata and ZPCstructures
 Theoretical Computer Science
, 2001
"... The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the comp ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether the nondeterministic automaton is an unrestricted one, an homogeneous one, a position one or a ZPCstructure, which is an implicit construction for a position automaton.
The treatment of epsilon moves in subset construction
 IN FINITESTATE METHODS IN NATURAL LANGUAGE PROCESSING, ANKARA. CMPLG/9804003
, 1998
"... The paper discusses the problem of determinizing finitestate automata containing large numbers of εmoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of εmoves. The paper identifies and compares a number ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The paper discusses the problem of determinizing finitestate automata containing large numbers of εmoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of εmoves. The paper identifies and compares a number of subset construction algorithms that treat εmoves. Experiments have been performed which indicate that the algorithms differ considerably in practice, both with respect to the size of the resulting deterministic automaton, and with respect to practical efficiency. Furthermore, the experiments suggest that the average number of εmoves per state can be used to predict which algorithm is likely to be the fastest for a given input automaton.
Instruction Computation in Subset Construction
 Automata Implementation
, 1996
"... Subset construction is the method of converting a nondeterministic finitestate machine into a deterministic one. The process of determinization is an important one in any implementation of finitestate machines since nondeterministic machines are often easier to describe than their deterministic eq ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Subset construction is the method of converting a nondeterministic finitestate machine into a deterministic one. The process of determinization is an important one in any implementation of finitestate machines since nondeterministic machines are often easier to describe than their deterministic equivalents and the conversion of regular expressions to finitestate machines usually produces nondeterministic machines. We discuss one aspect of subset construction; namely, the computation of the instructions of the equivalent deterministic machine. Although the discussion is to some extent independent of any specific assumptions, we draw some conclusions within the context of INR and Grail, both packages for the manipulation of finitestate machines. The aim of the discussion is to present the problem and suggest some possible solutions; we do not intend to and cannot be definitive since much remains unknown. z This research was supported by grants from the Natural Sciences and Engineeri...
On the performance of automata minimization algorithms
 DCC  FC & LIACC, UNIVERSIDADE DO PORTO
, 2007
"... Apart from the theoretical worstcase running time analysis not much is known about the averagecase analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results. We applied thes ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Apart from the theoretical worstcase running time analysis not much is known about the averagecase analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results. We applied these algorithms to both deterministic and nondeterministic random automata.
Grail: Engineering Automata in C++
, 1993
"... Objects: Automata and regular expressions : : : : : 11 3.2 User level : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 3.3 Programmer interface : : : : : : : : : : : : : : : : : : : : : : 13 4 Software organization 16 4.1 System directories : : : : : : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Objects: Automata and regular expressions : : : : : 11 3.2 User level : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 3.3 Programmer interface : : : : : : : : : : : : : : : : : : : : : : 13 4 Software organization 16 4.1 System directories : : : : : : : : : : : : : : : : : : : : : : : : 16 4.2 Classes : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 17 4.3 A class directory : : : : : : : : : : : : : : : : : : : : : : : : : 17 4.4 Making the code : : : : : : : : : : : : : : : : : : : : : : : : : 19 4.5 Test directory : : : : : : : : : : : : : : : : : : : : : : : : : : : 19 5 Miscellaneous information 19 5.1 How do I obtain Grail? : : : : : : : : : : : : : : : : : : : : : 19 5.2 Related software systems : : : : : : : : : : : : : : : : : : : : 20 5.3 Future work : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21 5.4 C++ references : : : : : : : : : : : : : : : : : : : : : : : : : : 21 5.5 Organizational quirks : : : : : : : : : : : : : : : : : : : : : :...
Treatment of epsilonMoves in Subset Construction
, 2000
"... The paper discusses the problem of determinising finitestate automata containing large numbers of emoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of emoves. ..."
Abstract
 Add to MetaCart
The paper discusses the problem of determinising finitestate automata containing large numbers of emoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of emoves.
Evaluating and Predicting . . .
, 2008
"... This thesis proposes a new notion of semantic coverage in formal testing: actual coverage. It is defined for test case and test suite executions, as well as for sequences of their executions. A fault is considered to be completely covered if an execution showed its presence, and it is considered p ..."
Abstract
 Add to MetaCart
This thesis proposes a new notion of semantic coverage in formal testing: actual coverage. It is defined for test case and test suite executions, as well as for sequences of their executions. A fault is considered to be completely covered if an execution showed its presence, and it is considered partly covered if an execution increased the confidence in its absence. Actual coverage can be used to evaluate a test process after it has taken place, but we also describe how to predict actual coverage in advance. To support these estimations, a probabilistic execution model is introduced. We derive efficient formulae for both the evaluation and the prediction of actual coverage, making tool support feasible. We show
Sparse Table Composition  Separate Compilation and Binary Extensibility of Grammars
, 2008
"... ..."
Random Generation of Nondeterministic Tree Automata
"... Algorithms for (nondeterministic) finitestate tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The runtime results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number ..."
Abstract
 Add to MetaCart
Algorithms for (nondeterministic) finitestate tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The runtime results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number of states of an equivalent minimal deterministic finitestate tree automaton is extremely small. It is demonstrated that nontrivial random NTA are obtained only for a narrow band of transition probabilities. Moreover, an analytical analysis yields a formula to approximate the transition probability that yields the most complex random NTA. 1