edited by
1,855 views
0 votes
0 votes

Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language recognized by A. The above automata ‘A’ is modified by adding an epsilon-transition from Qf to Q0. The language accepted by the modified ‘A’ in terms of ‘L’ will be :

  1.  Same as L

  2.  Accepts null

  3.  Accepts universal language

  4. Accept L+
edited by

1 Answer

0 votes
0 votes

Option (4)

Suppose language L was accepting 'ab' string. After adding an epsilon from Qto Qo , its starts accepting ab(ab)*. So the Language will become L+

Related questions

0 votes
0 votes
2 answers
2
prisonmatch asked Jan 6, 2019
1,182 views
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
0 votes
0 votes
2 answers
3
jhaanuj2108 asked Sep 26, 2018
620 views
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
0 votes
0 votes
1 answer
4
jhaanuj2108 asked Sep 26, 2018
675 views
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.