def reversalternaryWC(m=5):
"""Worst case automata for reversal(DFA) ternary alphabet
:arg m: number of states
:type m: integer
:returns: a dfa
:rtype: DFA"""
if m < 3:
raise TestsError("number of states must be greater than 2")
d = DFA()
d.setSigma(["a", "b", "c"])
d.setInitial(0)
d.addFinal(0)
d.States = range(m)
d.addTransition(0, "a", m - 1)
d.addTransition(0, "c", 0)
d.addTransition(0, "b", 0)
d.addTransition(1, "c", m - 1)
d.addTransition(1, "b", 0)
d.addTransition(1, "a", 0)
for i in range(2, m):
d.addTransition(i, "a", i - 1)
d.addTransition(i, "c", i - 1)
d.addTransition(i, "b", i)
return d
def disjWStarWC(m=6, n=5):
"""
..seealso:: Yuan Gao and Sheng Yu. 'State complexity of union and intersection
combined with star and reversal'. CoRR, abs/1006.3755, 2010.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
if n < 3 or m < 3:
raise TestsError("number of states must be greater than 2")
f1 = DFA()
f1.setSigma(["a", "b", "c"])
f1.States = range(m)
f1.setInitial(0)
f1.addFinal(m - 1)
f1.addTransition(0, "a", 1)
f1.addTransition(0, "b", 0)
f1.addTransition(0, "c", 0)
for i in range(1, m):
f1.addTransition(i, "a", (i + 1) % m)
f1.addTransition(i, "b", (i + 1) % m)
f1.addTransition(i, "c", i)
f2 = DFA()
f2.setSigma(["a", "b", "c"])
f2.States = range(n)
f2.setInitial(0)
f2.addFinal(n - 1)
for i in range(n):
f2.addTransition(i, "a", i)
f2.addTransition(i, "b", i)
f2.addTransition(i, "c", (i + 1) % n)
return f1, f2
def starWC(m=5):
""" Worst case automata for star(DFA) with m > 2, k=2
..seealso:: S. Yu, Q. Zhuang, and K. Salomaa. The state complexities
of some basic operations on regular languages.
Theor. Comput. Sci., 125(2):315–328, 1994.
:arg m: number of states
:type m: integer
:returns: a dfa
:rtype: DFA"""
if m < 3:
raise TestsError("number of states must be greater than 2")
# for m=2, L=\{w\in\{a,b\}*| |w|a odd \}
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(m - 1)
f.addTransition(0, "a", 1)
f.addTransition(0, "b", 0)
for i in range(1, m):
f.addTransition(i, "a", (i + 1) % m)
f.addTransition(i, "b", (i + 1) % m)
return f
def starWCM(m=5):
""" Worst case automata for star(DFA) with m > 2, k=2
..seealso:: A. N. Maslov. Estimates of the number of states of
finite automata. Dokllady Akademii Nauk SSSR, 194:1266–1268, 1970.
:arg m: number of states
:type m: integer
:returns: a dfa
:rtype: DFA"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(m - 1)
f.addTransition(m - 1, "a", 0)
f.addTransition(m - 1, "b", m - 2)
f.addTransition(0, "b", 0)
f.addTransition(0, "a", 1)
for i in range(1, m - 1):
f.addTransition(i, "a", (i + 1))
f.addTransition(i, "b", (i - 1))
return f
def unionWCTk2(m=6, n=6):
""" @ worst-case family union where
@m>=2 and n>=2 and k=2
..seealso:: Gao, Y., Salomaa, K., Yu, S.: Transition complexity of
incomplete dfas. Fundam. Inform. 110(1-4), 143–158 (2011)
@ the conjecture in this article fails for this family
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(0)
d1.addTransition(m - 1, "a", 0)
for i in range(0, m - 1):
d1.addTransition(i, "b", i + 1)
d2.setSigma(["a", "b"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
d2.addTransition(n - 1, "b", n - 1)
for i in range(0, n - 1):
d2.addTransition(i, "a", i + 1)
d2.addTransition(i, "b", i)
return d1, d2
def unionWCT2(n=6):
""" @ worst-case family union where
@m=1 and n>=2 and k=3
@ Note that the same happens to m>=2 and n=1
:arg n: number of states
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
m = 1
if n < 2:
raise TestsError("number of states must both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b", "c"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(0)
d1.addTransition(0, "b", 0)
d1.addTransition(0, "c", 0)
d2.setSigma(["a", "b", "c"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
d2.addTransition(0, "a", 0)
d2.addTransition(0, "b", 1)
for i in range(1, n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "a", i)
d2.addTransition(i, "c", 1)
return d1, d2
def booleanWCSymGrp(m=3):
"""Witness for symmetric group
:rtype: DFA
..seealso:
Jason Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis.
Symmetric Groups and Quotient Complexity of Boolean Operations.
ICALP (2) 2014: 1-12
"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(0)
f.addFinal(1)
f.addTransition(0, "a", 1)
f.addTransition(1, "a", 0)
f.addTransition(0, "b", 1)
f.addTransition(1, "b", 2)
for i in range(2, m):
f.addTransition(i, "b", (i + 1) % m)
f.addTransition(i, "a", i)
return f
def concatWCT(m=6, n=6):
""" @ worst-case family concatenation where
@m>=2 and n>=2 and k=3
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b", "c"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(m - 1)
d1.addTransition(0, "a", 1)
d1.addTransition(0, "c", 0)
for i in range(1, m):
d1.addTransition(i, "a", (i + 1) % m)
d1.addTransition(i, "b", 0)
d1.addTransition(i, "c", i)
d2.setSigma(["a", "b", "c"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
d2.addTransition(0, "a", 0)
d2.addTransition(0, "b", 1)
for i in range(1, n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "a", i)
d2.addTransition(i, "c", 1)
return d1, d2
def suffWCe(m=3):
"""Witness for suff(L) when L does not have empty as a quotient
:rtype: DFA
..seealso:
Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou,
Quotient Complexity of Closed Languages.
Theory Comput. Syst. 54(2): 277-292 (2014)
"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(0)
f.addTransition(0, "a", 1)
f.addTransition(1, "a", 2)
f.addTransition(0, "b", 0)
f.addTransition(1, "b", 0)
for i in range(2, m):
f.addTransition(i, "a", (i + 1) % m)
f.addTransition(i, "b", i)
return f
def universal(n, l=None, Finals=None, dialect=False, d=None):
"""Universal witness for state compelxity
:arg int n: number of states
:arg [str] l: alphabet
:arg [int] Finals: list of final states
:arg bool dialect: is it a dialect
:returns: dfa
:rtype: DFA
"""
if n < 3:
raise TestsError("number of states must be greater than 2")
u = DFA()
u.States = range(n)
if l is None:
l = ("a", "b", "c")
u.setSigma(list(l))
u.setInitial(0)
u.addFinal(n - 1)
u.addTransition(0, "b", 1)
u.addTransition(1, "b", 0)
if "c" in l:
u.addTransition(n - 1, "c", 0)
for i in range(n):
u.addTransition(i, "a", (i + 1) % n)
if i >= 2:
u.addTransition(i, "b", i)
if i != n - 1 and "c" in l:
u.addTransition(i, "c", i)
return u
def reversalWC3L(m=5):
""" Worst case automata for reversal(DFA) with m > 2, k=3
..seealso:: E. L. Leiss. Succinct representation of regular languages
by boolean automata ii. Theor. Comput. Sci., 38:133–136, 1985.
:arg m: number of states
:type m: integer
:returns: a dfa
:rtype: DFA"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b", "c"])
f.States = range(m)
f.setInitial(0)
f.addFinal(0)
f.addTransition(0, "b", 1)
f.addTransition(1, "b", 0)
f.addTransition(0, "a", 1)
f.addTransition(1, "a", 2)
f.addTransition(0, "c", m - 1)
f.addTransition(1, "c", 1)
for i in range(2, m):
f.addTransition(i, "a", (i + 1) % m)
f.addTransition(i, "b", i)
f.addTransition(i, "c", i)
return f
def disjWC(m=6, n=5):
""" Worst case automata for disjunction(DFA,DFA) with m,n >1
..seealso:: S. Yu, Q. Zhuang, and K. Salomaa. The state complexities
of some basic operations on regular languages.
Theor. Comput. Sci., 125(2):315–328, 1994.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA, DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b"])
d1.States = range(m)
d1.setInitial(0)
d1.addTransition(0, "a", 1)
d1.addTransition(0, "b", 0)
for i in range(1, m):
d1.addTransition(i, "a", (i + 1) % m)
d1.addTransition(i, "b", i)
d1.addFinal(i)
d2.setSigma(["a", "b"])
d2.States = range(m)
d2.setInitial(0)
d2.addTransition(0, "b", 1)
d2.addTransition(0, "a", 0)
for i in range(n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "a", i)
d2.addFinal(0)
return d1, d2
def epsilonDFA(sigma=None):
"""
Returns the minimal DFA for {epsilon} (incomplete)
:param sigma:
:return:
"""
d = DFA()
if sigma is not None:
d.setSigma(sigma)
i = d.addState()
d.setInitial(i)
d.addFinal(i)
return d
def revFibonnacci(n):
a = DFA()
a.setSigma(["a", "b"]),
for i in range(n):
a.addState(i)
a.setInitial(0)
for i in range(n):
if i % 2 != 0:
if i < n - 1:
a.addTransition(i, 'b', i + 1)
if i < n - 2:
a.addTransition(i, 'a', i + 2)
else:
if i < n - 2:
a.addTransition(i, 'b', i + 2)
if i < n - 1:
a.addTransition(i, 'a', i + 1)
a.addFinal(n - 1)
return a
def starWCT(m=5):
""" @ worst-case family star where
@m>=2 and k=2
:arg m: number of states
:type m: integer
:returns: dfa
:rtype: DFA"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(m - 1)
f.addTransition(0, "a", 1)
for i in range(1, m):
f.addTransition(i, "a", (i + 1) % m)
f.addTransition(i, "b", (i + 1) % m)
return f
def starInterBC(m=3, n=3):
"""Bad case automata for starInter(DFA,DFA) with m,n>1
..seealso:: Arto Salomaa, Kai Salomaa, and Sheng Yu. 'State complexity of
combined operations'. Theor. Comput. Sci., 383(2-3):140–152, 2007.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b", "c", "d", "e"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(m - 1)
for i in range(m):
d1.addTransition(i, "a", (i + 1) % m)
d1.addTransition(i, "b", i)
d1.addTransition(i, "c", i)
d1.addTransition(i, "d", i)
d1.addTransition(i, "e", i)
d2.setSigma(["a", "b", "c", "d", "e"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
for i in range(n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "a", i)
d2.addTransition(i, "c", n - 2)
if i == n - 2:
d2.addTransition(i, "d", n - 1)
elif i == n - 1:
d2.addTransition(i, "d", n - 2)
else:
d2.addTransition(i, "d", i)
if i > n - 4:
d2.addTransition(i, "e", i)
else:
d2.addTransition(i, "e", i + 1)
return d1, d2
def shuffleWC(m=3, n=3):
"""Worst case automata for shuffle(DFA,DFA) with m.n>1
..seealso::
C. Campeanu, K. Salomaa, and S. Yu. Tight lower bound for
the state complexity of shuffle of regular languages.
Journal of Automata, Languages and Combinatorics, 7(3):303–310, 2002.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA, DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.States = range(m)
d1.setSigma(["a", "b", "c", "d", "f"])
d1.setInitial(0)
d1.addFinal(0)
for i in range(m):
d1.addTransition(i, "a", (i + 1) % m)
if i != m - 1:
d1.addTransition(i, "c", i + 1)
d1.addTransition(i, "d", i)
if i != 0:
d1.addTransition(i, "f", i)
d2.States = range(n)
d2.setSigma(["a", "b", "c", "d", "f"])
d2.setInitial(0)
d2.addFinal(0)
for i in range(n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "c", i)
if i != n - 1:
d2.addTransition(i, "d", i + 1)
if i != 0:
d2.addTransition(i, "f", i)
return d1, d2
def startDFASemRule(self, lst, context=None):
"""
:param context:
:param lst:
:param context:"""
new = DFA()
while self.states:
x = self.states.pop()
new.addState(x)
new.Sigma = self.alphabet
x = self.initials.pop()
new.setInitial(new.stateIndex(x))
while self.finals:
x = self.finals.pop()
new.addFinal(new.stateIndex(x))
while self.transitions:
(x1, x2, x3) = self.transitions.pop()
new.addTransition(new.stateIndex(x1), x2, new.stateIndex(x3))
self.theList.append(new)
self.initLocal()
def suffFreeSyntWC(m=5):
"""
"""
if m < 5:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b", "c", "d", "e"])
f.States = range(m)
f.setInitial(0)
f.addFinal(1)
f.addTransition(0, "a", m - 1)
f.addTransition(0, 'b', m - 1)
f.addTransition(0, 'c', m - 1)
f.addTransition(0, 'd', m - 1)
f.addTransition(0, 'e', 1)
f.addTransition(1, "a", 2)
f.addTransition(1, 'c', 1)
f.addTransition(1, 'e', m - 1)
f.addTransition(1, 'd', m - 1)
f.addTransition(1, 'b', 2)
f.addTransition(2, 'b', 1)
f.addTransition(2, "a", 3)
f.addTransition(2, "c", 2)
f.addTransition(2, "e", m - 1)
f.addTransition(2, 'd', 2)
f.addTransition(1, 'd', m - 1)
f.addTransition(m - 2, 'c', 1)
f.addTransition(m - 2, 'a', 1)
for sym in f.Sigma:
f.addTransition(m - 1, sym, m - 1)
for i in range(3, m - 1):
f.addTransition(i, "b", i)
if i != m - 2:
f.addTransition(i, "c", i)
f.addTransition(i, "a", (i + 1))
f.addTransition(i, "d", i)
f.addTransition(i, "e", m - 1)
return f
def concatWCB(m=4, n=4):
""" Worst case automata for catenation(DFA,DFA) with m,n > 1, k=2,
..seealso::Jirásek, J., Jiráaskováa, G., Szabari, A., 2005.
State complexity of concatenation and complementation of regular
languages. Int. J. Found. Comput. Sci. 16 (3), 511–529.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA, DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(m - 1)
d1.addTransition(m - 1, "b", 0)
d1.addTransition(m - 1, "a", m - 1)
for i in range(m - 1):
d1.addTransition(i, "a", i)
d1.addTransition(i, "b", i + 1)
d2.setSigma(["a", "b"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
d2.addTransition(n - 1, "a", 0)
d2.addTransition(n - 1, "b", 0)
d2.addTransition(0, "a", 0)
d2.addTransition(0, "b", 1)
d2.addTransition(n - 2, "a", n - 1)
for i in range(1, n - 1):
d2.addTransition(i, "a", i + 1)
d2.addTransition(i, "b", i + 1)
return d1, d2
def startDFASemRule(self, lst, context=None):
"""
:param context:
:param lst:
:param context:"""
new = DFA()
while self.states:
x = self.states.pop()
new.addState(x)
new.Sigma = self.alphabet
x = self.initials.pop()
new.setInitial(new.stateIndex(x))
while self.finals:
x = self.finals.pop()
new.addFinal(new.stateIndex(x))
while self.transitions:
(x1, x2, x3) = self.transitions.pop()
new.addTransition(new.stateIndex(x1), x2, new.stateIndex(x3))
self.theList.append(new)
self.initLocal()
def suffWCsynt(m=3):
""" Worst case witness for synt of suff(L)
"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b", "c", "d", "e"])
f.States = range(m)
f.setInitial(0)
f.addFinal(m - 1)
f.addTransition(0, "a", 0)
f.addTransition(0, "b", 0)
f.addTransition(0, "c", 0)
f.addTransition(0, "d", 0)
f.addTransition(0, "e", 1)
f.addTransition(1, "a", 2)
f.addTransition(1, "b", 2)
f.addTransition(1, "c", 1)
f.addTransition(1, "d", 1)
f.addTransition(1, "e", 1)
f.addTransition(2, "b", 1)
f.addTransition(2, "e", 1)
f.addTransition(2, "c", 2)
f.addTransition(2, "d", 2)
f.addTransition(2, "a", 3)
for i in range(3, m - 1):
f.addTransition(i, "a", (i + 1) % m)
f.addTransition(i, "b", i)
f.addTransition(i, "c", i)
f.addTransition(i, "d", i)
f.addTransition(i, "e", 1)
f.addTransition(m - 1, "a", 1)
f.addTransition(m - 1, "c", 1)
f.addTransition(m - 1, "e", 1)
f.addTransition(m - 1, "d", 0)
return f
def concatWCM(m=4, n=4):
""" Worst case automata for catenation(DFA,DFA) with m,n > 1, k=2,
..seealso:: A. N. Maslov. Estimates of the number of states of
finite automata. Dokllady Akademii Nauk SSSR, 194:1266–1268, 1970.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA, DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.setSigma(["a", "b"])
d1.States = range(m)
d1.setInitial(0)
d1.addFinal(m - 1)
d1.addTransition(m - 1, "b", 0)
d1.addTransition(m - 1, "a", m - 1)
for i in range(m - 1):
d1.addTransition(i, "a", i)
d1.addTransition(i, "b", i + 1)
d2.setSigma(["a", "b"])
d2.States = range(n)
d2.setInitial(0)
d2.addFinal(n - 1)
d2.addTransition(n - 1, "a", n - 1)
d2.addTransition(n - 1, "b", n - 2)
d2.addTransition(n - 2, "b", n - 1)
d2.addTransition(n - 2, "a", n - 1)
for i in range(n - 2):
d2.addTransition(i, "a", i + 1)
d2.addTransition(i, "b", i)
return d1, d2
def suffWCd(m=3):
"""Witness for suff(L) when L has empty as a quotient
:rtype: DFA
..seealso: as above
"""
if m < 3:
raise TestsError("number of states must be greater than 2")
f = DFA()
f.setSigma(["a", "b"])
f.States = range(m)
f.setInitial(0)
f.addFinal(0)
f.addTransition(0, "a", 1)
f.addTransition(1, "a", 2)
f.addTransition(0, "b", m - 1)
f.addTransition(1, "b", 0)
f.addTransition(m - 1, "b", m - 1)
f.addTransition(m - 1, "a", m - 1)
for i in range(2, m - 1):
f.addTransition(i, "a", (i + 1) % (m - 1))
f.addTransition(i, "b", i)
return f
def starDisjWC(m=6, n=5):
"""Worst case automata for starDisj(DFA,DFA) with m.n>1
..seealso: Arto Salomaa, Kai Salomaa, and Sheng Yu. 'State complexity of
combined operations'. Theor. Comput. Sci., 383(2-3):140–152, 2007.
:arg m: number of states
:arg n: number of states
:type m: integer
:type n: integer
:returns: two dfas
:rtype: (DFA,DFA)"""
if n < 2 or m < 2:
raise TestsError("number of states must be both greater than 1")
d1, d2 = DFA(), DFA()
d1.States = range(m)
d1.setSigma(["a", "b", "c"])
d1.setInitial(0)
d1.addFinal(0)
for i in range(m):
d1.addTransition(i, "a", (i + 1) % m)
d1.addTransition(i, "b", i)
if i != 0:
d1.addTransition(i, "c", i)
d1.addTransition(0, "c", 1)
d2.States = range(n)
d2.setSigma(["a", "b", "c"])
d2.setInitial(0)
d2.addFinal(0)
for i in range(n):
d2.addTransition(i, "b", (i + 1) % n)
d2.addTransition(i, "a", i)
if i != 0:
d2.addTransition(i, "c", i)
d2.addTransition(0, "c", 1)
return d1, d2
def reversalbinaryWC(m=5):
"""Worst case automata for reversal(DFA) binary
..seealso:: G. Jir{\'a}skov{\'a} and J. S\v ebej. Note on Reversal of binary regular languages. Proc. DCFS 2011,
LNCS 6808, Springer, pp 212-221.
@arg m: number of states
@type m: integer
@returns: a dfa
@rtype: DFA"""
if m < 2:
raise TestsError("number of states must be greater than 1")
d = DFA()
d.setSigma(["a", "b"])
d.States = range(m)
d.setInitial(0)
d.addFinal(m - 1)
d.addTransition(0, "a", 1)
d.addTransition(0, "b", 0)
d.addTransition(1, "b", 0)
if m == 2:
d.addTransition(1, "a", 0)
else:
d.addTransition(1, "a", 2)
d.addTransition(2, "a", 0)
if m == 3:
d.addTransition(2, "b", 2)
else:
d.addTransition(2, "b", 3)
d.addTransition(3, "b", 2)
d.addTransition(3, "a", 4)
d.addTransition(m - 1, "a", 3)
d.addTransition(m - 1, "b", m - 1)
for i in range(4, m - 1):
d.addTransition(i, "a", i + 1)
d.addTransition(i, "b", i)
return d
