COMPILER DESIGN

Detailed explanation-1: -9. Finite automata requires minimum number of stacks. Explanation: Finite automata doesn’t require any stack operation. 10.

Detailed explanation-2: -In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language.

Detailed explanation-3: -Hence, 10 states are there in a minimum state deterministic finite automaton accepting the language L. There are two types of finite automata: 1. Deterministic Finite Automata(DFA): In this type of automata, each pair of state & input can have only one next state.

Detailed explanation-4: -A finite-state machine just looks at the input signal and the current state: it has no stack to work with. It chooses a new state, the result of following the transition. A pushdown automaton (PDA) differs from a finite state machine in two ways: It can use the top of the stack to decide which transition to take.

Detailed explanation-5: -Limitations of Finite Automata The defining characteristic of FA is that they have only a finite number of states. Hence, a finite automata can only “count” (that is, maintain a counter, where different states correspond to different values of the counter) a finite number of input scenarios.