607 views
0 0 votes

For this given 3 state machine, what will be the regular expressions for the following cases:

  1. When A is the final state. 
  2. When B is the final state
  3. When C is the final state 

Please log in or register to answer this question.

Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
7.7k
7.7k views
Akash Kumar Roy asked Jun 3, 2019
7,691 views
A->aB/bA/bB->aC/bBC->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there?According to me there should be 2 final states: A...
0 0 votes
0 0 answers
10.1k
10.1k views
surbhijain93 asked May 9, 2018
10,054 views
I wanted to covert the finite automata of the question 'when no two a's and no two b's should come together' to regular expression. But I am not able to do so.I have atta...
0 0 votes
0 0 answers
2.4k
2.4k views
HenryAsks21 asked Mar 30, 2022
2,443 views
Convert the following regular expression (0+11)0*1 to NFA with e-transitions using the procedure given on pg. 66-67 Theorem 1.54 (Lemma 1.55) of the Introduction to Theor...