LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
True
|
|
|
False
|
|
|
May be true
|
|
|
May be False
|
Detailed explanation-1: -A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
Detailed explanation-2: -Explanation: The definition states that moore machines output is determined by the current state only. 3. Which of the following statement is true for Mealy Machine? Explanation: The definition states that its output is determined by current state and current input.
Detailed explanation-3: -a finite state machine (FSM) with outputs A FSM is considered to have memory (as you’ll see in examples) because the current output depends not only on the current input but on the present state of the machine which itself is a summary of the past history of the machine. 0 1 1 0 1 0 1.
Detailed explanation-4: -String X is accepted by finite automata if . 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.