automata_definitions package¶
Submodules¶
automata_definitions.bollig_habermehl_kern_leucker_automata module¶
-
class
automata_definitions.bollig_habermehl_kern_leucker_automata.BolligHabermehlKernLeuckerAutomata¶ Bases:
object- Class containing automata from paper:
Bollig B. and Habermehl P. and Kern C. and Leucker M. 2009. Angluin-style learning of NFA. IJCAI International Joint Conference on Artificial Intelligence. 1004-1009.
-
get_all_automata: list(FiniteAutomaton) returns a list containing all automata defined in this class
-
get_first_example_DFA: DeterministicFiniteAutomaton returns the automaton 1 from the paper
-
get_first_example_NFA: NondeterministicFiniteAutomaton returns the automaton 2 from the paper
-
static
get_all_automata()¶ Method returning a list of all automata of the class
- Returns
all automata defined in the class
- Return type
list(FiniteAutomaton)
-
static
get_first_example_DFA() → automata.deterministic_finite_automaton.DeterministicFiniteAutomaton¶ Method returning a DFA that recognizes the regular expresion Σ*aΣ^2 (First example from paper, Fig. 3.)
- Returns:
DFA: Method returning a DFA that recognizes the regular expresion Σ*aΣ^2
-
static
get_first_example_NFA() → automata.deterministic_finite_automaton.DeterministicFiniteAutomaton¶ Method returning a NFA that recognizes the regular expresion Σ*aΣ^2 (First example from paper, Fig. 4.)
- Returns:
DFA: Method returning a DFA that recognizes the regular expresion Σ*aΣ^2
automata_definitions.omlin_giles_automata module¶
-
class
automata_definitions.omlin_giles_automata.OmlinGilesAutomata¶ Bases:
object- Class containing automata from paper:
Christian W. Omlin and C. Lee Giles. 1996. Constructing deterministic finite-state automata in recurrent neural networks. J. ACM 43, 6 (Nov. 1996), 937–972. DOI:https://doi.org/10.1145/235809.235811
-
get_all_automata: list(DeterministicFiniteAutomaton) returns a list containing all automata defined in this class
-
get_a_automaton: DeterministicFiniteAutomaton returns the automaton A from the paper
-
get_b_automaton: DeterministicFiniteAutomaton returns the automaton B from the paper
-
get_az_automaton: DeterministicFiniteAutomaton returns the automaton A from the paper with stuttering symbol (d)
-
get_bz_automaton: DeterministicFiniteAutomaton returns the automaton A from the paper with stuttering symbol (d)
-
static
get_a_automaton()¶ method with specification of the automaton A from the paper
- Returns
automaton A from the paper
- Return type
-
static
get_all_automata()¶ method returning a list of all automata of the class
- Returns
all automata defined in the class
- Return type
-
static
get_az_automaton()¶ method with specification of the automaton A from the paper, with a stuttering symbol
- Returns
automaton A from the paper, with a stuttering symbol
- Return type
-
static
get_b_automaton()¶ method with specification of the automaton B from the paper
- Returns
automaton B from the paper
- Return type
-
static
get_bz_automaton()¶ method with specification of the automaton B from the paper, with a stuttering symbol
- Returns
automaton B from the paper, with a stuttering symbol
- Return type
automata_definitions.other_automata module¶
-
class
automata_definitions.other_automata.OtherAutomata¶ Bases:
object-
static
get_a_ending_automaton()¶
-
static
get_a_ending_with_cs_automaton()¶
-
static
get_a_or_b_automaton()¶
-
static
get_ab_automaton()¶
-
static
get_ab_with_cs_automaton()¶
-
static
get_all_automata()¶
-
static
get_alternating_bit_protocol_automaton()¶
-
static
get_alternating_bit_protocol_z_automaton()¶
-
static
get_automaton_1()¶
-
static
get_automaton_1_minimized()¶
-
static
get_automaton_2()¶
-
static
get_automaton_2_minimized()¶
-
static
get_automaton_3()¶
-
static
get_automaton_3_minimized()¶
-
static
get_automaton_4()¶
-
static
get_automaton_4_minimized()¶
-
static
get_complex_ab_prefixed_automaton()¶
-
static
get_dfa_1()¶
-
static
get_dfa_2()¶
-
static
get_dfa_3()¶
-
static
get_dfa_4()¶
-
static
get_dfa_5()¶
-
static
get_different_ecommerce_automaton_NFA()¶
-
static
get_dolzhenko_jonoska_automaton()¶
-
static
get_ecommerce_automaton()¶
-
static
get_empty_automaton()¶
-
static
get_nfa_1()¶
-
static
get_nfa_2()¶
-
static
get_nfa_3()¶
-
static
get_nfa_4()¶
-
static
get_nfa_5()¶
-
static
get_non_minimizable_automaton_1()¶
-
static
get_non_minimizable_automaton_2()¶
-
static
get_non_minimizable_automaton_3()¶
-
static
get_nonempty_one_ending_automaton()¶
-
static
get_nonempty_zero_ending_automaton()¶
-
static
get_program_workflow_automaton()¶
-
static
get_reduced_ecommerce_automaton()¶
-
static
get_sigma_star_automaton()¶
-
static
get_simpler_ab_prefixed_automaton()¶
-
static
get_uneven_number_of_as_and_symbols_automaton()¶
-
static
get_uneven_number_of_as_automaton()¶
-
static
get_uneven_number_of_as_or_symbols_automaton()¶
-
static
get_uneven_number_of_symbols_automaton()¶
-
static
get_zero_ending_automaton()¶
-
static
automata_definitions.sample_nfas module¶
automata_definitions.tomitas_grammar_modifications module¶
automata_definitions.tomitas_grammars module¶
-
class
automata_definitions.tomitas_grammars.TomitasGrammars¶ Bases:
objectClass containing automata from paper: Tomita, M. (1982). Dynamic Construction of Finite Automata from examples using Hill-climbing. Proceedings of the Fourth Annual Conference of the Cognitive Science Society (p./pp. 105–108), Ann Arbor, Michigan.
-
get_all_automata: list(DeterministicFiniteAutomaton) returns a list containing all automata defined in this class
-
get_automaton_1: DeterministicFiniteAutomaton returns the automaton 1 from the paper
-
get_automaton_2: DeterministicFiniteAutomaton returns the automaton 2 from the paper
-
get_automaton_3: DeterministicFiniteAutomaton returns the automaton 3 from the paper
-
get_automaton_4: DeterministicFiniteAutomaton returns the automaton 4 from the paper
-
get_automaton_5: DeterministicFiniteAutomaton returns the automaton 5 from the paper
-
get_automaton_6: DeterministicFiniteAutomaton returns the automaton 6 from the paper
-
get_automaton_7: DeterministicFiniteAutomaton returns the automaton 7 from the paper
-
static
get_all_automata()¶ Method returning a list of all automata of the class
- Returns
all automata defined in the class
- Return type
-
static
get_automaton_1()¶ Method with specification of the automaton 1 from the paper
The first Tomita’s grammar is defined as the regular expresion: 1*
- Returns
automaton 1 from the paper
- Return type
-
static
get_automaton_2()¶ Method with specification of the automaton 2 from the paper
The second Tomita’s grammar is defined as the regular expresion: (10)*
- Returns
automaton 2 from the paper
- Return type
-
static
get_automaton_3()¶ Method with specification of the automaton 3 from the paper
The third Tomita’s grammar recognizes strings that don’t contain the regular expresion (1^(2n+1), 0^(2m+1)) as substring.
- Returns
automaton 3 from the paper
- Return type
-
static
get_automaton_4()¶ Method with specification of the automaton 4 from the paper
The fourth Tomita grammar recognizes strings that don’t contain the regular expresion 000 as substring.
- Returns
automaton 4 from the paper
- Return type
-
static
get_automaton_5()¶ Method with specification of the automaton 5 from the paper
The fifth Tomita’s grammar recognizes strings that have an even ammount of 01 and 10
- Returns
automaton 5 from the paper
- Return type
-
static
get_automaton_6()¶ Method with specification of the automaton 6 from the paper
The sixth Tomita’s grammar recognizes strings where (ammount of 0) - (amount of 1) = multiple of 3.
- Returns
automaton 5 from the paper
- Return type
-
static
get_automaton_7()¶ Method with specification of the automaton 7 from the paper
The seventh Tomita’s grammargrammar is defined as the regular expresion: 0*1*0*1* :returns: automaton 7 from the paper :rtype: DeterministicFiniteAutomaton
-