Finite state machines & Regular Expressions
Please select the best option
1.
For the following questions Let r, s, t be regular expressions for the same alphabet "á" (left column). Get the property on the right side that produces equality for each regular expression.
2.
From the diagram of the solution M = (Σ, Q, s,, F) is respectively:
e would be NONE.
3.
The following graph corresponds to a diagram of:
A. Transition machine and states
b. Transition from a deterministic finite automata
c. Transition from a finite non-deterministic automata
d. No response
E. Language of transition and states
4. From the diagram of the solution M = (Σ, Q, s, ,F,) is
respectively:
1. Answer:
rφ = φ [By annihilator for concatenation]
rt+st = (r+s)t [By the reverse distribution rule]
r+r = r [By idempotent law]
φ+r = r [By identity for union]
φ+φ = φ [By simplification]
2. Answer: option b is correct.
3. Ansswer: option b is correct.
4. Answer: option d is correct.
Note: my friend if you have any questions or queries comment below. I will sort out your queries. Thank you my friend.
Finite state machines & Regular Expressions Please select the best option 1. For the following questions...
Solve the following Deterministic Finite Automata ( DFA ). For Σ = {0, 1} Construct a DFA M such that L(M) = { w : w ends with 101 followed by an ODD number of 0's} Draw the state diagram and transition table..... 1) Given A Formal Definition M = (Q, Σ, ? , q, F) 2) Trace the Path (Listing States) taken by words state whether each word is accepted or rejected. w = 101010 v = 1010100 u...
1. (1 point) Which of the following is true? A. Every regular language is a context-free language. B. Every context-free language is a regular language. C. If a language is context-free, then there exists a pushdown automata to recognize it. D. The set of context free languages is strictly larger than the set of regular languages. E. Each of A,C, and D is true. 2. (1 point) The following diagram shows a context free grammar with start variable S and...
1. (1 point) Which of the following is true? A. Every regular language is a context-free language. B. Every context-free language is a regular language. C. If a language is context-free, then there exists a pushdown automata to recognize it. D. The set of context free languages is strictly larger than the set of regular languages. E. Each of A,C, and D is true. 2. (1 point) The following diagram shows a context free grammar with start variable S and...