Theory Of Computation (2160704)

Applications of Finite Automata

1. Lexical analysis phase of a compiler.
2. Design of digital circuit.
3. String matching.
4. Communication Protocol for information exchange.

(i) the language accepting strings ending with '01' over input alphabets Σ = {0, 1}

(ii) the language accepting strings ending with 'abba' over input alphabets Σ = {a, b}