Last updated on:May 27th, 2018,

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 .

0Shares

Leave a Reply

Your email address will not be published.