Menu Close

Language of Strings of length two or more, defined over Σ = {a, b}, beginning with and ending in different letters.

The language L may be expressed by the following regular expression
a (a + b)* a + b (a + b)* b

1 Comment

  1. Pingback: Automata Practice Questions | Usman's Blog

Leave a Reply

Your email address will not be published. Required fields are marked *