recategorized by
3,346 views
1 votes
1 votes

A finite automaton accepts which type of language : 

  1. Type $0$
  2. Type $1$
  3. Type $2$
  4. Type $3$
recategorized by

2 Answers

1 votes
1 votes
Type 0: Recursive enumerable language

Type 1:  context sensitive language

Type 2 : context free language

Type 3: Regular language

Option D is correct.
0 votes
0 votes
Option D is correct Type-3 is accepted by finite automata.
Answer:

Related questions

2 votes
2 votes
4 answers
1
admin asked Mar 31, 2020
1,631 views
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
2 votes
2 votes
3 answers
2
admin asked Mar 31, 2020
1,576 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
3
admin asked Mar 31, 2020
3,616 views
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
1 votes
1 votes
2 answers
4
admin asked Mar 31, 2020
992 views
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said