Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 3

• recategorized by
2,411 views
2 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

4 Answers

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

So C is correct.
Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2017 DEC Scie...Next → · NIELIT 2017 DEC Scie...
← Previous in category · NIELIT 2017 DEC Scie...Next in category → · NIELIT 2017 OCT Scie...
Position:
Show:

Related questions

3 3 votes
4 4 answers
2.8k
2.8k views
admin asked Mar 31, 2020
2,751 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
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 1 vote
4 4 answers
5.0k
5.0k views
admin asked Mar 31, 2020
4,977 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
1 1 vote
2 2 answers
4.3k
4.3k views
admin asked Mar 31, 2020
4,280 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 31
A finite automaton accepts which type of language : Type $0$Type $1$Type $2$Type $3$
1 1 vote
2 2 answers
1.6k
1.6k views
admin asked Mar 31, 2020
1,637 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 40
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said