FAdo.rndfap

Random DFA generation (alternative version in python)

ICDFA Random generation binding

New in version 1.0.

class ICDFArgen(n, k, nd=False, pn=1, seed=0)[source]

Generic ICDFA random generator class

Variables:

  • n (int) – number of states

  • k (int) – size of the alphabet

  • pn (int) – how more problable shall a non defined transition be?

  • seed (int) – seed for the random generator. Default is to generate a time & system dependent.

See also

Marco Almeida, Nelma Moreira, and Rogério Reis. Enumeration and generation with a string automata representation. Theoretical Computer Science, 387(2):93-102, 2007

Changed in version 1.3.4: seed added to the random generator

genFinalities()[source]

Generate bit map of final states

Return type:

list

class ICDFArnd(n, k, seed=0)[source]

Complete ICDFA random generator class

This is the class for the uniform random generator for Initially Connected DFAs

Variables:

  • n (int) – number of states

  • k (int) – size of alphabet

  • seed (int) – seed for the random generator (if 0 uses time as seed)

Note

This is an abstract class, not to be used directly

Changed in version 1.3.4: seed added to the random generator

class ICDFArndIncomplete(n, k, bias=None, seed=0)[source]

Incomplete ICDFA random generator class

Variables:

  • n (int) – number of states

  • k (int) – size of alphabet

  • bias (float) – how often must the gost sink state appear (default None)

  • seed (int) – seed for the random generator (if 0 uses time as seed)

Raises:

IllegalBias – if a bias >=1 or <=0 is provided

Changed in version 1.3.4: seed added to the random generator