MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false?
Statement: An NFA can be m..
1.
State true or false?
Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.
A.
True
B.
False
Answer» B. False
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which among the following is false?<br> -closure of a subset S of Q is:
For NFA with -moves, which among the following is correct?
Predict the total number of final states after removing the -moves from the given NFA?
- closure of q1 in the given transition graph:
Statement 1: - transition can be called as hidden non-determinism.<br>Statement 2: (q, ) = p means from q it can jump to p with a shift in read head.
State true or false?<br>Statement: (Input) does not appears on Input tape.
State true or false?<br>Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply