recategorized by
1,631 views
2 votes
2 votes

The automaton which allows transformation to a new state without consuming any input symbols : 

  1. $NFA$
  2. $DFA$
  3. $NFA - 1$
  4. All of the options
recategorized by

4 Answers

1 votes
1 votes
In epsilon NFA we can have transition without consuming symbols.

So C is correct.
Answer:

Related questions

2 votes
2 votes
3 answers
1
admin asked Mar 31, 2020
1,571 views
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
1 votes
1 votes
4 answers
2
admin asked Mar 31, 2020
3,610 views
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
1 votes
1 votes
2 answers
3
1 votes
1 votes
2 answers
4
admin asked Mar 31, 2020
991 views
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said