You need to prepare regular expression and finite automata


You need to prepare regular expression and finite automata

Question: Give REs and FAs with alphabet "a,b" for

Part 1) all strings with exactly 3 a's

Part 2) all strings with the number of a's divisible by 3

Explain each and every question in depth with examples.

Request for Solution File

Ask an Expert for Answer!!
Theory of Computation: You need to prepare regular expression and finite automata
Reference No:- TGS0952131

Expected delivery within 24 Hours