Question: Which of the following FAs accepts a finite language and which an infinite one? (i) (ii) (iii) (iv) (1 b b (1 (1 a. b
Which of the following FAs accepts a finite language and which an infinite one?
(i)

(ii)

(iii)

(iv)

(1 b b (1 (1 a. b h b
Step by Step Solution
3.43 Rating (162 Votes )
There are 3 Steps involved in it
The language accepted by a finite automata FA if there exists a cycle on a path from which the final ... View full answer
Get step-by-step solutions from verified subject matter experts
