... produced.¹

Indeed, a later implementation by Nederhof avoids construction of the complete non-determistic automaton by minimising sub-automata before they are embedded into larger sub-automata.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...instruction-computation.²

According to Derick Wood (p.c.), this approach has been implemented in several systems, including Howard Johnson's INR system.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... states.³

Note that a set of start states is required, rather than a single start state. Many operations on automata can be defined somewhat more elegantly in this way (including per graph^t discussed below). Obviously, for deterministic automata this set should be a singleton set.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... well.⁴

This is an improvement over the algorithm given in a preliminary version of this paper [21].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... techniques.⁵

All the automata used in the experiments are freely available from http://www.let.rug.nl/~vannoord/Fsa/.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... 2.⁶

Leslie uses the terms absolute density and deterministic density.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.