Which regular expression generates the language of ALL alternating strings over 2 ={a, b}, including trivial strings such as the empty string or one-character strings?A. a(ba)* + b(ab)* + ɛB. (a+ɛ)(ba)*(b+ɛ)C. (a+b+ɛ)(ba+ab)*2. Including a trap state, how many states are there in the minimum-state DFA for thelanguage over E = {a,b} described by the regular expression (b + bab)* ?А. 5В. 4С.33. Which of the following grammars generates the language (b + bab)* ?A. S - bS | basB. S → E| bS | babsC. S → E| bS | bas | babs4. If M is a minimum-state DFA for some language L with n states and i final states, whatcan be said about the minimum-state DFA M' for the complementary language E* - L?A. M’ will also have n states but with n-i final states.B. M' will have up to n? states and up to i? final states.C. M' will have up to 2ª states and up to 2' final states.5. What is the complement of the language a(a+b)*b under the alphabet E = {a, b}?A. b(a+b)*aB. b(a+b)*a+ɛC. b(a+b)* + (a+b)*a+ ɛ

As per our guidelines only 3 mcqs are answered. So, please repost the remaining questions…

1. Which regular expression generates the language of ALL alternating strings over E = {a, b}, including trivial strings such as the empty string or one-character strings? A. a(ba)* + b(ab)* + ɛ В. (а+8)(ba)*(b+:) C. (a+b+ɛ)(ba+ab)* 2. Including a trap state, how many states are there in the minimum-state DFA for the language over E = {a,b} described by the regular expression (b + bab)* ? А. 5 В. 4 С.3 3. Which of the following grammars generates the language (b+ bab)* ? A. S - bS | bas B. S → 8| bS| babS C. S - 8| bS | baS | babS

1. Which regular expression generates the language of ALL alternating strings over E = {a, b}, including trivial strings such as the empty string or one-character strings? A. a(ba)* + b(ab)* + ɛ В. (а+8)(ba)(b+:) C. (a+b+ɛ)(ba+ab) 2. Including a trap state, how many states are there in the minimum-state DFA for the language over E = {a,b} described by the regular expression (b + bab)* ? А. 5 В. 4 С.3 3. Which of the following grammars generates the language (b+ bab)* ? A. S - bS | bas B. S → 8| bS| babS C. S - 8| bS | baS | babS

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

For each of the following languages give a regular expression that describes it. 1- A1 = {w|w is a non-empty string over E = {0, 1}}. 2- A2= {w € {ab}* ]w contains an odd number of as and each a is followed by at least one b}. 3- A3 = {w € {ab}*| w does not contain three a's}
What is the regular expression that generates the language of strings that contain an even number of b's? (Please answer with the shortest possible regex: minimal parentheses, no spaces and any piped strings in alphabetical order!)
Let L be the language defined by the regular expression: (cu ab u b)*bb (c U ab) (a) Write 10 distinct strings that belong to L. If such strings do not exist, explain why. (b) Write 10 distinct strings over alphabet {a, b, c} that do not belong to L. If such strings do not exist, explain why.
No plagarism please Correct and detailed answer will be Upvoted. Thank you!!!
List all strings in L whose length is less than 5, where L is defined by the regular expression (a + b)* ba (a + ab)*
Let -(1, 2, 3). Let L. be the language denoted by the regular expression: (21+ A) 33 (A+ 11 + 22) Write all the strings in the language L. Thats all the info the problem gives
Write java program to read string and testing first latter if upper latter to change small latter else change to upper latter
Construct a regular expression over {a, b} containing all string that have an even number of a’s an odd number of b’s
Construct a PDA that matches all strings in the language over {x,y} such that each string has an odd length and its middle symbol is 'x'. Editor Below, give a short description of the set of strings associated with each state of your PDA.
What is the regular expression that generates the language of strings that contain at least two a's? (Please answer with the shortest possible regex: minimal parentheses, no spaces and any piped strings in alphabetical order!)
Show all the steps correctly.