1. Engineering
  2. Computer Science
  3. construct a fa for the language of all strings where...

Question: construct a fa for the language of all strings where...

Question details

Construct a FA for the language of all strings where characters in odd numbered positions (i.e. the 1st, 3rd, 5th, etc.) must be the letter "a" and convert the FA into a regular expression.

NOTE: The empty string does satisfy the requirement.

Please show steps if possible!

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution