GATE IT 2004 | Question: 41
Let $M=(K, Σ, \sigma, s, F)$ be a finite state automaton, where $K = \{A, B\}, Σ = \{a, b\}, s = A, F = \{B\},$ $\sigma(A, a) = A, \sigma(A, b) = B, \sigma(B, a) = B \text{ and} \ \sigma(B, b) = A$ A grammar to generate the language accepted by $M$ can be ... $\{A → bB, A → aB, B → aA, B → bA, B → \epsilon)$ $\{A → aA, A → bA, B → aB, B → bA, A → \epsilon)$
Let $M=(K, Σ, \sigma, s, F)$ be a finite state automaton, where$K = \{A, B\}, Σ = \{a, b\}, s = A, F = \{B\},$$\sigma(A, a) = A, \sigma(A, b) = B, \sigma(B, a) = B \tex...