Table of Contents

Name

genaut - generates an automaton of given parameters

Synopsis

genaut states symbols|classes fanout finalperc [ initseed ]

Description

genaut generates an automaton of given parameters. The exact form of the automaton is also determined by the compile options. The automaton is in the format of Gertjan van Noord's fsa program.

Arguments

states
the number of states in the generated automaton.
symbols
the number of symbols in the alphabet of the generated automaton. This parameter has a different meaning (classes) when genaut is compiled with -DLIMCLASS.
classes
the number of different classes of states in the generated automaton. Two states belong to the same class if they are both final or non-final, they have the same number of transitions, and they have the same symbols on those transitions. This parameters is available only when the program is compiled with -DLIMCLASS. Otherwise, this argument has a different meaning (symbols).
fanout
number of outgoing transitions per state. If compiled with -DLIMCLASS, this is the exact number of outgoing transitions for every state. Otherwise it is the maximal one.
finalperc
percentage of final states in the automaton. The actual percentage may be higher to eliminate states with no path to any of the final states.
initseed
initial seed of the random number generator (useful for debugging).

Exit Status

  1. OK
  2. bad parameters.

See Also

minimize(1) , inflate(1) . Also see the page http://www.pg.gda.pl/~jandac/minim.html.

Bugs

Finality is not taken into account when calculating the number of classes. Send bug reports to the author: Jan Daciuk, jjaannddaacc@eti.pg.gda.pl (remove the stuttering)


Table of Contents