(a) Construct deterministic finite automata accepting the following languages:{w e {0, 1}"| w is not in the regular language defined by 0"1"};(ii) {w e (0, 1}"| w has an even number of O's or an odd number of l's) (payattention to or in this definition);(ii ( E {0, 1}"| w ends with a subword 01, i.e., w = 101 for some word r}.(i)

Answered: Image /qna-images/answer/dc7572ef-24f2-4c02-965c-9aa2cd7a9401.jpg

(a) Construct deterministic finite automata accepting the following languages: (i) {w e {0, 1}"| w is not in the regular language defined by 0"1'}3; (ii) {w e {0,1}"| w has an even number of 0's or an odd number of l's} (pay attention to or in this definition); (ii fw E {0, 1}"|w ends with a subword 01, i.e., w = r01 for some word z}.

(a) Construct deterministic finite automata accepting the following languages: (i) {w e {0, 1}"| w is not in the regular language defined by 0"1'}3; (ii) {w e {0,1}"| w has an even number of 0's or an odd number of l's} (pay attention to or in this definition); (ii fw E {0, 1}"|w ends with a subword 01, i.e., w = r01 for some word z}.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Construct npda that accept the following regular language: L1 = L (aaa∗bab).
Finite Automata Question: Mention atleast 6 strings of each regular expression that is listed below: let A={a,b,c,d} B={blue,green,red} C={@,#,%,&} D={0,1,2} 1) (A*C* | C*)* 2) B.A.C* | (A+B+C+D) 3) (B* | AC)(DA | B*)
Finite AutomataA. {w| w begins with an "a" and ends with a "b"}B. {w| w contains at least three a's}
Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be a) {w | w is a string of odd length} b) {w | w is a string of length multiple of 3} c) {w | w is a string of length 3} d) All of the mentioned Theory of automata question
8. Build a DPDA that accepts the language L = {(ab)" (aab)b² n ≥0
1. a) Write the regular expression for the following where ∑= (a, b)i. All string starting with a and ending with bii. even length stringsiii. odd length stringsiv. strings divisible by 3 b) Design a minimal Deterministic Finite Automata (DFA) for question a) above c) Write a regular expression to describe inputs over the alphabet {a, b, c} i. that are in sorted order ii. containing at least one a and at least one b D. Answer True or False for the following questions a) Deterministic Finite Automata (DFA) can be used to depict a set of languages that cannot be depicted using an Nondeterministic Finite Automata (NFA) (True/False)b) DFA and NFA both can depict exactly same set of languages (True/False)c) DFA can have at most one final state (True/False)d) NFA can have at most one start state (True/False)e) Every regular expression can be written using context-free grammar (CFG) (True or False)
Question No: Design FAs for the following: a. Build an FA that accepts only those words that have even no. of "a" and even number of "b". b. Write regular expressions and build a finite automaton for language contains all the words having even number of a's? c. Write regular expressions and finite automata for language that starts with "aa", ends at "bb" and fourth character should be "b" d. Build transition Graph that accepts the language of all words in which the a's occur only in even clumps and that end in three or more b's. e. FA accepts all strings without a double b.
10. a. Define clearly but completely: Language L is decidable. b. Let ALLDFA = {M: M is a DFA and L (M) = Σ*} — that is, this is the language of deterministic finite automata that accept all strings. Show that ALLDFA is decidable.
(a) Construct deterministic finite automata accepting the following languages: (i) {w e {0, 1}*| w is not in the regular language defined by 0*1*}; (ii) {w e {0, 1}*| w has an even number of O's or an odd number of l's} (pay attention to or in this definition); (iii) {w e {0,1}*|wends with a subword 01, i.e., w = x01 for some word r }.
1. Which of the following finite automata is known to recognize the regular language? a) Deterministic Finite Automaton (DFA) b) Non-Deterministic Finite Automaton with e-transitions (NFA-e) c) Both a and b d) None of the above
b) Dr Josette Anansewa, a renowned compiler designer working with IBM Corporation, has successfully produced a context-free grammar that a semantic analyzer uses in the compilation process. This grammar has the productions rules: S> aAB, A > Bba, B > bB, B →c Required: (a). Derive the word acbabc (B). Construct the derivation tree for the word acbabc.
13. Show that the language L = {a" : n > 0, n # 4} is regular.