Suppose alphabet E= {0,1}, design a DFA (draw its state diagram) to recognize each of the following languages: (1) {w\w contains an even number of Os } (2) {w\w at most one 1 } (3) {w\w contains the substring 0101 } (4) {w| each 0 in w is followed by at least one 1 } (5) {w\w contains either the substrings 01 or 10 }

Suppose alphabet E= {0,1}, design a DFA (draw its state diagram) to recognize each of the following languages: (1) {w\w contains an even number of Os } (2) {w\w at most one 1 } (3) {w\w contains the substring 0101 } (4) {w| each 0 in w is followed by at least one 1 } (5) {w\w contains either the substrings 01 or 10 }

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

a. Design a PDA to accept the following languages: L1 = {x = wcw* for w E {a, b}* ; x E {a, b, c}* } L2 = { a' b' c* | i, j, k > 0; i =j or j = 2k } %3D
Construct PDAs that accept each of the following languages : (a) L = {w : w = w R, that is, w is a palindrom in {a, b} ∗} (b) L = {w : w starts and ends with the same symbol, w ∈ {a, b} ∗} (c) L = {a i .bj .ck : i + k = j}
Program the following in C language. Implement the following equation 3x4sin(180x) + 4x3 cos(90x) + x2sin(tan(45)) + 7x + 9cos(90x2 )where x may be user defined value.
Design a PDA for the language L={w e {a, b, c}*|na(w) + n6(w) = nc(w)}.
3. Construct the PDA for each of the following languages: (i) L₁ = {amb²mc | m, n >0} (iii) (ii) L₂= {ambc²m | m, n >0} L3 = {a^bmc²mdm | n ≥0, m>0}
4. Prove the following two languages are context-free: (1) {a*b°c*d° |n> 0} (2) {waw | w e{a,b}*}. In other words, we want odd length palindromes with a in the middle.
Design a PDA to generate strings of each language below. Draw Diagrams. L= {w E {a, b}* | w contains at least three a's} a) 2x 3x b) L= {b²x c³x | x2 0}, where Σ = {b,c}
1. Convert the given Ɛ-NFA to NFA 2. Write regular expressions for the following languages: {w | w contains at least two 0s} {w | w begins with a 1 and ends with a 0} 1∑ * 0 {w | w contains at least three 1s {w | the length of w is at most 5 {w | w contains an even number of 0s, or contains exactly two 1s} Even number of 0s:
Design a PDA to generate strings of the following language (Σ={a, b}): L={a4n b2n | n ≥ 0}
Write down regular expressions for the following languages.(a) {w ∈ {0, 1}^∗: w does not end in 101} (b) {w ∈ {a, b, c}^∗ : w starts with abba and ends in bac} (c) {w ∈ {a, b}^∗: the number of as in w is 1 more than a multiple of 3}
Draw a PDA transition diagram that recognize the following language: a. L1 = { a i b j c k | i, j, k ≥ 0 and i + j = k } b. L2 = { w ∈ {0, 1}∗ | w contains at least two 1s}
Provide a DFA or NFA (whichever is easier) for the following languages {w|w does not contain the string bbab or aaa}, Σ = {a, b}