Results 1 
1 of
1
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...