When a car arrives at the toll gate, the gate is closed. the gate opens as soon as the driver has paid 25 pesewas. we assume that we have only three coins denominations 5,10 and 25 pesewas. We also assume that no excess change is returned. After having arrived at the toll gate, the driver inserts a sequence of coins into the machine. At the moment, the machine has to decide whether or not to open the gate. whether or not the driver has paid 25 pesewas (or more). a)construct the state transition table for the above scenario b) convert the state transition table to a minimal DFA
When a car arrives at the toll gate, the gate is closed. the gate opens as soon as the driver has paid 25 pesewas. we assume that we have only three coins denominations 5,10 and 25 pesewas. We also assume that no excess change is returned. After having arrived at the toll gate, the driver inserts a sequence of coins into the machine. At the moment, the machine has to decide whether or not to open the gate. whether or not the driver has paid 25 pesewas (or more).
a)construct the state transition table for the above scenario
b) convert the state transition table to a minimal DFA
1.given the grammar
F to mMpQ|QnF
Q to mMpM|pM|q
M to mQ|mQp|m
(i) Using top-down approach, derive mqpmmqmqpn
(ii) Using the bottom-up approach, derive qppmmpnpm
Using top-down approach, derive
i. mmpmnmmpq
ii. mmpq
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
1.a) Using a Cross Product method, construct a minimal DFA of w ∑ (a, b) *, where Number of 'a' in a string w mod 2=0 and number of 'b' in a string w mod 2=0
b) Using Expression "position=initial + rate *70', briefly explain the compilation stages and show how each phase will translate the expression.
b)Construct the NFA that will accept the string of abc|abd
c)Construct a grammar which accept 'a' string starting with a and ending with 'b'
i.Construct a parse tree for the above grammar in b)
e)Construct the NFA that will accept the string of (dc|ac)* dc (aa|bb)*dc
f)Construct the NFA that will accept the string of the regular expression dc(a|b|c)* (aa|dc)*
g)Construct the grammar and generate the Leftmost Derivation (LMD) and the Rightmost Derivation (RMD) for the expression 9-5+2
.(a) Construct a Non-deterministic Finite Automata (NFA) that can recognize the set of strings formed by acb (ab/c)*
by Bartleby Expert
