Let language L over alphabet Σ = { a, b } be defined as L = { a'b* }, where i is a multiple of some given n and k is a multiple of some given m, all non- negative integers. In other words: L contains all strings consisting of: o A number of a's that is a multiple of n o followed by a number of b's that is a multiple of m. Using a constructive method, show that for any given values of n and m, L is regular.

Let language L over alphabet Σ = { a, b } be defined as L = { a'b* }, where i is a multiple of some given n and k is a multiple of some given m, all non- negative integers. In other words: L contains all strings consisting of: o A number of a's that is a multiple of n o followed by a number of b's that is a multiple of m. Using a constructive method, show that for any given values of n and m, L is regular.

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

Let ∑ = {a, b}. Given the language L = {b^n a^m: m,n≥0}, find the regular expression r such that L(r) = L.
Prove that L2 = {w = {0,1}+ | w starts and ends with the same symbol} is regular. string of length 1 (e.g., w = 0) starts and ends with the same symbol.
Let Σ={0,1}. Give a regular expression r over Σ such that L(r) = { w in Σ* | (w contains at least 2 symbols, that is, the length of w is at least 2) and (the first symbol of w is different from the last symbol of w) and (centre (w) is mimsy according to the following two definitions)}. For any string y containing at least 2 symbols, let centre (y) be the substring of y obtained by removing the first symbol and the last symbol of y. A string x over Σ is called mimsy if x is made up of either • at least two 0-symbols (and no 1-symbols), or an even number of 1-symbols (and no 0-symbols).
Prove that F = {ww|w is a string from {0,1}*} is not regular. Consider the string s=0p10p1. Note that {0,1}* is any string (including the empty string) containing any number of 0s and 1s (in any order).
Find all strings in L(ba + ab*a) of length less than four. Find a regular expression for the set { a" bm : n, m are even}.