1 votes 1 votes A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$ Theory of Computation nielit2017dec-assistanta theory-of-computation identify-class-language finite-automata + – admin asked Mar 31, 2020 • recategorized Aug 24, 2020 by Lakshman Bhaiya admin 3.4k views answer comment Share Follow See 1 comment See all 1 1 comment reply Sanandan commented Sep 1, 2020 reply Follow Share Type-3 is accepted by FA 0 votes 0 votes Please log in or register to add a comment.
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. Hradesh patel answered Mar 31, 2020 Hradesh patel comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option D is correct Type-3 is accepted by finite automata. Sanandan answered Sep 14, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.