language accepted by DFA

Asked Apr 14 '18 at 17:37

Active Sep 12 '18 at 18:01

Viewed 570 times

what are the language that the DFA accept ?

so my approach for the first one is : a needs to be 4n+1 for all n>=0, #b%2=0 also i found out there some loops inside the DFA and a:b ratio is 3:1

but how do i write it formally ? L = {W |.... } ?

second DFA is that the word must end with letter b, there also few loops, so a* can be accepted and folloing with b... so... (a)* b but whats next ?

edited Apr 15 '18 at 08:12

Raphael

asked Apr 14 '18 at 17:37

user87202

Hint for the first: look at $a+2b \bmod{4}$. – Yuval Filmus Apr 14 '18 at 19:17
For the second, one way is to decompose the input into runs, and concentrate on the odd runs. There might be a nicer description, though. – Yuval Filmus Apr 14 '18 at 19:55

0 Answers0