Search code examples
finite-automata

Finite Automata Definition of language

Hi I am trying to define a language accepted by an FA in simple terms the FA is:

s

I think it is the language with strings

(not starting with ab and not having substring bb and also ending with an a) and also the NULL string

But I do not know if this is the shortest definition or correct at all?

Solution

  • All the even length strings which do not have 'b' at any of the even positions.