Thread: Finite state and regular expressions

I created this masterpiece of a diagram based on a next -state table. Now I' having trouble with the following. Any help would be appreciated. Thanks!

#1 Which of the following strings are accepted by the automation?
00
01
10
11
101
010

#2 Write a regular expression defining the language accepted by the automation.




==============================



Which strings are accepted by automation?
00
01
10
11
101
010
0101001

==========================

Which strings are accepted by regular expression, 1*234*5

11123
1111235
1235
123123
45123

Any help/pointers would be appreciated. I just need some pointers on how to do these. Thanks again.