FAdo.comboperations

Several combined operations for DFAs

Combined operations

concatWStar(fa1, fa2, strict=False)[source]

Concatenation combined with star: (L1.L2*)

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Bo Cui, Yuan Gao, Lila Kari, and Sheng Yu. ‘State complexity of two combined operations: Reversal-catenation and star-catenation’. CoRR, abs/1006.4646, 2010.

disjWStar(f1, f2, strict=True)[source]

Union with Star: (L1 + L2*)

Parameters:

  • f1 (DFA) – first automaton

  • f2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Yuan Gao and Sheng Yu. ‘State complexity of union and intersection combined with Star and reversal’. CoRR, abs/1006.3755, 2010.

interWStar(f1, f2, strict=True)[source]

Intersection with Star: (L1 & L2*)

Parameters:

  • f1 (DFA) – first automaton

  • f2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Yuan Gao and Sheng Yu. ‘State complexity of union and intersection combined with Star and reversal’. CoRR, abs/1006.3755, 2010.

starConcat(fa1, fa2, strict=False)[source]

Star of concatenation of two languages: (L1.L2)*

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Yuan Gao, Kai Salomaa, and Sheng Yu. ‘The state complexity of two combined operations: star of catenation and star of reversal’. Fundamenta Informaticae, 83:75–89, Jan 2008.

starDisj(fa1, fa2, strict=False)[source]

Star of Union of two DFAs: (L1 + L2)*

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Arto Salomaa, Kai Salomaa, and Sheng Yu. ‘State complexity of combined operations’. Theor. Comput. Sci., 383(2-3):140–152, 2007.

starInter(fa1, fa2, strict=False)[source]

Star of Intersection of two DFAs: (L1 & L2)*

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

starInter0(fa1, fa2, strict=False)[source]

Star of Intersection of two DFAs: (L1 & L2)*

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Arto Salomaa, Kai Salomaa, and Sheng Yu. ‘State complexity of combined operations’. Theor. Comput. Sci., 383(2-3):140–152, 2007.

starWConcat(fa1, fa2, strict=False)[source]

Star combined with concatenation: (L1*.L2)

Parameters:

  • fa1 (DFA) – first automaton

  • fa2 (DFA) – second automaton

  • strict (bool) – should the alphabets be necessary equal?

Return type:

DFA

See also

Bo Cui, Yuan Gao, Lila Kari, and Sheng Yu. ‘State complexity of catenation combined with Star and reversal’. CoRR, abs/1008.1648, 2010