Register

DFA NFA

256 views
0 votes
0 votes

Given an NFA that recognizes L, to build an NFA to recognize the reverse of L , containing every string  in reverse, it suffices to swap the initial and final states and reverse all edges.

 

 

False.

it is also false for DFA too.becz dfa may have more than one final state which will be changed to initial state after transformation i.e many initial state which is not possible.

Am i correct?

User Avatar

1 Answer

1 votes
1 votes
Yes True. DFA can only have one initial state, but can have zero, one or more than one final states over any number of input alphabet.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Souvik33 asked Nov 7, 2022
351 views
Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
User Avatar
0 votes
0 votes
0 answers
2
Subhrangsu asked May 28, 2022
589 views
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
User Avatar
0 votes
0 votes
1 answer
4
aditi19 asked Dec 14, 2018
1,334 views
Conversion of NFA to DFA
convert the following NFA to DFA
convert the following NFA to DFA
User Avatar
Link Copied!