How can I write a regular expression that denotes language on the alphabet {a,b} of the strings that do not present "b" consecutive and the total number of "a" is multiple of three?.
Asked
Active
Viewed 76 times
0
-
4Construct a DFA/NFA for your language, and then convert it into a regular expression. – Yuval Filmus Jun 07 '19 at 10:45
-
Just make sure that you either add three a's (as many times you want with the kleene operator) or add an b and immediately 3 a's. Try to write this as a RegEx yourself – Panzerkroete Jun 07 '19 at 18:36
-
Check how to convert finite automata to regular expressions. – John L. Jun 07 '19 at 20:16