LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
If it is accepted by automata
|
|
|
If it halts
|
|
|
If automata touch final state in its life time
|
|
|
All language are language of automata
|
Detailed explanation-1: -Explanation: If automata starts with starting state and after finite moves if reaches to final step then it called accepted. Explanation: If a string accepted by automata it is called language of automata.
Detailed explanation-2: -The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. It is the most effective way to represent any language. The languages accepted by some regular expression are referred to as Regular languages.
Detailed explanation-3: -Regular Language: All languages accepted by a finite automaton or regular grammar is Regular Language. Finite Automaton: It is also called a Finite State Machine (FSM).
Detailed explanation-4: -A regular language satisfies the following equivalent properties: it is the language of a regular expression (by the above definition) it is the language accepted by a nondeterministic finite automaton (NFA) it is the language accepted by a deterministic finite automaton (DFA)
Detailed explanation-5: -The languages which can be accepted by PDA are called context-free languages (CFL), denoted by LCF. Diagrammatically, a PDA is a finite state automaton (see Fig. 5.1), with memories (push-down stacks).