[Programming] Finite State Automata: FSA Examples

Finite State Automata: FSA Examples

---

#01

∑={a,b}

L={aab+a}

 

∑={a,b}
L={aab+a}

L(aaba) -> Yes
L(aabbba) -> Yes
L(aabbbba) -> Yes

L(aabbb) -> No
L(aabbbaa) -> No
L(baaaa) -> No
L(baa) -> No

---

#02

∑={a,b}

L={a^xb^y | x,y > 0}

∑={a,b}
L={a^xb^y | x,y > 0}

L(aabb) -> Yes
L(ab) -> Yes
L(aabbb) -> Yes
L(aaaaaabb) -> Yes

L(bbbbb) -> No
L(aaaaa) -> No
L(abab) -> No
L(baa) -> No

---

#03

∑={a,b}

L={a(ba)*}

∑={a,b}
L={a(ba)*}

L(ababa) -> Yes
L(a) -> Yes
L(aba) -> Yes
L(abababababa) -> Yes

L(b) -> No
L(ab) -> No
L(abab) -> No
L(aa) -> No