(a) The language {a^ : n ≥ 0} {ba: n ≥ 1} with at most 4 states. (b) The language {w w either has no consecutive a's or no consecutive b's} with at most 5 states. (c) The language {w w contains an even number of a's or exactly two b's} with at most 6 states. (d) The language {ab, aab, aba}* with at most 4 states.

(a) The language {a^ : n ≥ 0} {ba: n ≥ 1} with at most 4 states. (b) The language {w w either has no consecutive a's or no consecutive b's} with at most 5 states. (c) The language {w w contains an even number of a's or exactly two b's} with at most 6 states. (d) The language {ab, aab, aba}* with at most 4 states.

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

1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. a. a*bc + bc* b. b*aaac* а. b.
I need help to construct a dpda for the language {w in {a,b}^*| w has an unequal amount of a and b}
Proof that the language L1 = {a' b' c' | i2 1} is not Context Free.
3. Give a DPDA that accepts the language {(ab) (ba)' : i > 0}
Prove that the following language is not context-free: L = {w#t|w_is a substring of t, where w,t E {a, b}*}.
13. Show that the language L = {a" : n > 0, n # 4} is regular.
Find the following language over the set {a,b}.
. Prove that the intersection of two context-free languages is not necessarily context-free. This is unlike the case of regular languages which are closed under intersections. Hint: Do something similar to what we did on Activity #21 to show something about two of the languages below and then use what we proved in class about the remaining language. Write several sentences to explain your reasoning. L₁ = {ww has the form a"b"c" for some whole numbers n and m} L2 = {ww has the form amb"c" for some whole numbers n and m} L3 = {w|w has the form a"b"c" for some whole number n}
Suppose thatL, is a regular language and L, is a context-free language. Which one of the following languages is NOT necessarily context-free? (a) L, L2 (c) L,- L2 (b) L,ULz (d) L, n Lz
Write a regular expression to describe each of the following languages. Example: {w = {a, b}* : w has both aa and bb as substrings} Regular expression: (a U b)* aa (a U b)* bb (a U b)* U (a U b)* bb (a U b)* aa (a U b)*
Create a PDA that accepts the language L = {w ∈ {a.b}* : na(v) ≥ nb(v), where v is any prefix of w}
6. Show that the following language is decidable: {{N, R) : N is an NFA and R is a regex and L(N) # L(R)}