Homework Answers
Add Answer to:
Q1) Consider the following push down automaton (PDA). wak READ, PUSH bREAD ACCEPT READ,ab REJECT b)...
Consider the following pushdown automaton A: 1, push x O, pop x 1, € / $...
Consider the following pushdown automaton A:
1, push x O, pop x 1, € / $ E, £ / € . E,$/E start 01 92 Which of the following words are accepted by A? (Select all and only correct answers. Incorrect ones incur a penalty.) 1 11000 11100 € 1100 110
Theory of Computation - Push Down Automata (PDA) and Context Free Grammars (CFG) Problem 1. From...
Theory of Computation - Push Down Automata (PDA) and Context
Free Grammars (CFG)
Problem 1. From a language description to a PDA Show state diagrams of PDAs for the following languages: a. The set of strings over the alphabet fa, b) with twice as many a's as b's. Hint: in class, we showed a PDA when the number of as is the same as the number of bs, based on the idea of a counter. + Can we use a...
QUESTION 4 What language does this final state PDA accept? / Is the start stack symbol...
QUESTION 4 What language does this final state PDA accept? / Is the start stack symbol and F is the final state) (S.a.X.nop,S) (S,b,X,nop,F) OO None of the choices O ab O aab ab QUESTION 5 Below is an empty stack PDA (X is the start stack symbol. O is the start state) with three transition rules: Rule1: (0,a.X.push(0,0) Rule2: (0,,X.pop,1) Rule3: (1.b.X.pop.1) Which of the following sequence of PDA transitions show that the string ab is valid ? Rulei,...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the following regular expression. 6* (ab U bc)(aa)* ccb* Which of the following strings are in the language: bccc, babbcaacc, cbcaaaaccbb, and bbbbaaaaccccbbb (Give reasons for why the string are or are not in the language). 2. Let G be a context free grammar in Chomsky normal form. Let w be a string produced by that grammar with W = n 1. Prove that the...
7.1 12) What language is accepted by the pda M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0,...
7.1 12) What language is accepted by the pda
M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0, z,
{q5}),
with
(q0,b,z) =
{(q1,1z)},
(q1,b,1)= {(q2,
11)},
(q2,a,1)= {(q3,
)},
(q3,a,1)= {(q4,
)},
(q4,a,z)= {(q4,
z), (q5, z)}
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were...
related to theory of automation. Thank you. 8- Consider the Following GTG: a) Find an equivalent GTG with only 2 states....
related to theory of
automation. Thank you.
8- Consider the Following GTG: a) Find an equivalent GTG with only 2 states. (5 Points) b) What is the language accepted by this graph.(15 Points) q1 q2 9-What language is accepted by the following GTG? (10 Points) a + b a + b q1 a + b qo q2 a + b+c
8- Consider the Following GTG: a) Find an equivalent GTG with only 2 states. (5 Points) b) What is the...
Question 12 2 pts You are given a machine as shown below: START PUSH, 6 READ...
Question 12 2 pts You are given a machine as shown below: START PUSH, 6 READ PUSH, b POP POP POP ACCEPT Using the approach discussed in the lecture video or follow the example in the textbook from page 480 to page 482, trace the execution of the input string on this machine:"abbaba". At every step, name the current STATE and write down the contents on the TAPE, STACK1, and STACK2. Then answer the following question: When the machine reaches...
1. Who are language descriptions intended for? Consider the following grammar: ab b | b a...
1. Who are language descriptions intended for? Consider the following grammar: ab b | b a | a Which of the following sentences are in the language generated by this grammar? (DONE) a) baab ==> YES b) bbbab ==> NO c) bbaaaaaS ==> NO d) bbaab ==> YES 2. Write a BNF grammar for the language consisting of binary strings (any combination of 0s and 1s) of at least 2 digits.
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
Question 15 2 pts You are given a machine as shown below: START PUSH26 READ PUSH,...
Question 15 2 pts You are given a machine as shown below: START PUSH26 READ PUSH, b POP2 POP POP ACCEPT Using the approach discussed in the lecture video or follow the example in the textbook from page 480 to page 482, trace the execution of the input string on this machine: "bbaaa". At every step, name the current STATE and write down the contents on the TAPE, STACK1, and STACK2. Then answer the following question: When the machine reaches...
Consider the following pushdown automaton A:
1, push x O, pop x 1, € / $ E, £ / € . E,$/E start 01 92 Which of the following words are accepted by A? (Select all and only correct answers. Incorrect ones incur a penalty.) 1 11000 11100 € 1100 110
Theory of Computation - Push Down Automata (PDA) and Context
Free Grammars (CFG)
Problem 1. From a language description to a PDA Show state diagrams of PDAs for the following languages: a. The set of strings over the alphabet fa, b) with twice as many a's as b's. Hint: in class, we showed a PDA when the number of as is the same as the number of bs, based on the idea of a counter. + Can we use a...
QUESTION 4 What language does this final state PDA accept? / Is the start stack symbol and F is the final state) (S.a.X.nop,S) (S,b,X,nop,F) OO None of the choices O ab O aab ab QUESTION 5 Below is an empty stack PDA (X is the start stack symbol. O is the start state) with three transition rules: Rule1: (0,a.X.push(0,0) Rule2: (0,,X.pop,1) Rule3: (1.b.X.pop.1) Which of the following sequence of PDA transitions show that the string ab is valid ? Rulei,...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the following regular expression. 6* (ab U bc)(aa)* ccb* Which of the following strings are in the language: bccc, babbcaacc, cbcaaaaccbb, and bbbbaaaaccccbbb (Give reasons for why the string are or are not in the language). 2. Let G be a context free grammar in Chomsky normal form. Let w be a string produced by that grammar with W = n 1. Prove that the...
7.1 12) What language is accepted by the pda
M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0, z,
{q5}),
with
(q0,b,z) =
{(q1,1z)},
(q1,b,1)= {(q2,
11)},
(q2,a,1)= {(q3,
)},
(q3,a,1)= {(q4,
)},
(q4,a,z)= {(q4,
z), (q5, z)}
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were...
related to theory of
automation. Thank you.
8- Consider the Following GTG: a) Find an equivalent GTG with only 2 states. (5 Points) b) What is the language accepted by this graph.(15 Points) q1 q2 9-What language is accepted by the following GTG? (10 Points) a + b a + b q1 a + b qo q2 a + b+c
8- Consider the Following GTG: a) Find an equivalent GTG with only 2 states. (5 Points) b) What is the...
Question 12 2 pts You are given a machine as shown below: START PUSH, 6 READ PUSH, b POP POP POP ACCEPT Using the approach discussed in the lecture video or follow the example in the textbook from page 480 to page 482, trace the execution of the input string on this machine:"abbaba". At every step, name the current STATE and write down the contents on the TAPE, STACK1, and STACK2. Then answer the following question: When the machine reaches...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
Question 15 2 pts You are given a machine as shown below: START PUSH26 READ PUSH, b POP2 POP POP ACCEPT Using the approach discussed in the lecture video or follow the example in the textbook from page 480 to page 482, trace the execution of the input string on this machine: "bbaaa". At every step, name the current STATE and write down the contents on the TAPE, STACK1, and STACK2. Then answer the following question: When the machine reaches...
Most questions answered within 3 hours.
-
QUESTION 8
Both of these statements will store the same value in the
variable $number
$number...
asked 8 minutes ago -
The price of 1 lb of potatoes is $1.75. If all the potatoes sold
today at...
asked 1 hour ago -
Garcia Company issues 20.00%, 15-year bonds with a par value of
$470,000 and semiannual interest payments....
asked 1 hour ago -
In C++ Programming, Try using loops only.
This lab demonstrates the use of the While Loop...
asked 1 hour ago -
Effect of DCMU and sodium azide on Chlamydomonas? We did an
experiment where we had Chlamydomonas...
asked 2 hours ago -
1a) According to the ideal gas law, _______________.
a. a gas has infinite volume at absolute...
asked 4 hours ago -
Oakdale Fashions, Inc. had $245,000 in 2018 taxable income.
Using the tax schedule in Table 2.3...
asked 4 hours ago -
The marketing class at CSUS had an average score of 150. An
educational analyst determined that...
asked 5 hours ago -
Justin Case has purchased a $250 000 home by putting 20 % down
and taking out...
asked 5 hours ago -
1. In a labor market, marginal cost for a firm is
____________.
a. recruiting cost
b....
asked 6 hours ago -
On January 1, 2019, ABC Company issued $60,000,000 of 20-year,
10.5% bonds when the market rate...
asked 6 hours ago -
39.4% of US homes continue to use a landline in addition to cell
phone service. 3...
asked 7 hours ago