Finite automata FA for the language of all those strings starting with a and ending with a in theory of automata

Built the finite state automata (FSA) for the language of all those strings starting with a and ending with a but does not contains single a, defined over ∑={a,b}?

Accepted Strings:

Following strings are part of the language and should be accepted by FSA.

Strings = {aa, aba, abba, aaa, aabba, abbaa,…………. }

Rejected Strings:

Following strings are not part of the language and should be rejected by FSA.

Strings = {a, b,  ba, bba, abab,  baba, babba, abbab,……..….. }

theory of automata easy tutorials

  List of All Finite Automata examples: Click Here .

Fazal Rehman Shamil
Welcome to all friends. The reason for our success is only your love for T4Tutorials. Our team is always available to answer your queries regarding any kind of confusions or discussion regarding your study and career matters. For discussion with us please join our facebook group "T4Tutorials.com". The link of the group is mentioned below. Thanks and love to all for connecting with us. We are nothing without you. Love you all.....
https://web.facebook.com/groups/2066136233601097/

Leave a Reply