edited by
617 views
0 votes
0 votes

Is the following language regular or not?

edited by

1 Answer

0 votes
0 votes
state/inputs x y z
A B B B
B C C C
C D D D
D E E E
E A A A

A is the initial as well as final state.

since we can draw a finite automata for this language

=> the language is regular.

Related questions

5 votes
5 votes
3 answers
2
Hirak asked May 25, 2019
1,739 views
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
0 votes
0 votes
1 answer
3