Module: Random ADFA Generator (rndadfa)

Random ADFA generation

ADFA Random generation binding

New in version 1.2.1.

Classes

ADFArnd

class ADFArnd(n, k=2, s=1)[source]

Sets a random generator for Adfas by sources. By default, s=1 to be initially connected

Variables

  • n (int) – number of states

  • k (int) – size of the alphabet

  • s (int) – number of sources

Note: For ICDFA s=1

alpha(n, s, k=2)[source]

Number of labeled acyclic initially connected DFA by states and by sources

Parameters

  • k (int) – alphabet size

  • n (int) – number of states

  • s (int) – number of souces

Return type

int

Note

uses countAdfabySource

alpha0(n, s, k=2)[source]

Number of labeled acyclic initially connected DFA by states and by sources

Parameters

  • k (int) – alphabet size

  • n (int) – number of states

  • s (int) – number of souces

Return type

int

Note

uses gamma instead of beta or rndAdfa

beta(n, s, u, k=2)[source]

Number of valid configurations of transitions

Parameters

  • k (int) – alphabet size

  • n (int) – number of states

  • s (int) – number of souces

  • u (int) – number of souces of n-s

Return type

int

Note

not used by alpha or rndAdfa

beta0(n, s, u, k=2)[source]

Function beta computed using sets

countAdfaBySources(n, s, k=2)[source]

Number of labelled (initially connected) acyclic automata with n states, alphabet size k, and s sources

Parameters

  • k (int) – alphabet size

  • n (int) – number of states

  • s (int) – number of souces

Raises

IndexError – if number of states less than number of sources

gamma(t, u, r)[source]
Parameters

  • t (int) – size of T

  • u (int) – size of U

  • r (int) – size of r

Return type

int

rndAdfa(n, s)[source]

Recursively generates a initially connected adfa

Parameters

  • n (int) – number of states

  • s (int) – number of sources

See also

Felice & Nicaud, CSR 2013 Lncs 7913, pp 88-99, Random Generation of Deterministic Acyclic Automata Using the Recursive Method, DOI:10.1007/978-3-642-38536-0_8

rndNumberSecondSources(n, s)[source]

Uniformaly random generates the number of secondary sources

Parameters

  • n (int) – number of states

  • s (int) – number of sources

Return type

int

rndTransitionsFromSources(n, s, u)[source]

Generates the transitions from the sources, ensuring that all secondary sources are connected

Parameters

  • n (int) – number of states

  • s (int) – number of sources

  • u (int) – number of secondary sources