• reopened by
842 views
0 0 votes

Here why they are saying we must convert DFA transition into NFA transition? 

 

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
477
477 views
PRAFFUL_CHAMOLI asked Jul 14, 2025
477 views
Question:LetL = { a^i b^j / i != 2j+1 } where i,j >=1  (a) Is LLL a deterministic context-free language (DCFL)?(b) Justify your answer with reasoning.
1 1 vote
1 1 answer
2.2k
2.2k views
Bhaskar Singh asked Feb 20, 2019
2,152 views
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) =...
0 0 votes
0 0 answers
787
787 views
sripo asked Oct 16, 2018
787 views
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
0 0 votes
2 2 answers
813
813 views
gatecse asked Mar 2, 2018
813 views
Statement 1 : For push down automata Determinism ≠ Non-determinismStatement 2 : For Finite Automata Non-determinism = DeterminismWhich of the following is correct?Both st...