Q No. 1: Write regular expressions and construct NFA for the following languages over the alphabet I =(a, b} a. Write a regular expression that contains at least two a's b. Write a regular expression that contains at least one a and one b c. Write a regular expression that contains exactly two a's d. All strings that do not end with 'aa' e. All strings that contain even number of a's f. All strings which do not contain the substring 'ab' g. All strings that contain odd number of a's and b's

Q No. 1: Write regular expressions and construct NFA for the following languages over the alphabet I =(a, b} a. Write a regular expression that contains at least two a's b. Write a regular expression that contains at least one a and one b c. Write a regular expression that contains exactly two a's d. All strings that do not end with 'aa' e. All strings that contain even number of a's f. All strings which do not contain the substring 'ab' g. All strings that contain odd number of a's and b's

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Built regular expression of the following. 1. A language of any combination of even number of a's and even number of b’s containing abb as a substring. 2. Write an RE for the language L = {0^1m | where m + n is odd}. 3. All string does not contain the substring 'aaa' but has exactly one 'a'
Write in C sharp programming We are given a string containing a list of forbidden words and a text containing some of these words. Write a program that replaces the forbidden words with asterisks. Example: Words: "PHP, CLR, Microsoft" The expected result: Microsoft announced its next generation PHP compiler today. It is based on .NET Framework 4.0 and is implemented as a dynamic language in CLR. ********* announced its next generation *** compiler today. It is based on .NET Framework 4.0 an
CS 404 Artificial Intelligence - LISP Handout 1 1. Write a program that prints teenager if age is between 13 and 19. 2. Write a LISP program to print multiplication table of 5. 3. Write a LISP function that takes radius as input parameter and compute circumference of a circle.
Exercise 7. Let E= {a,b,c}. Write a regular expression which can generate the language that has odd number of a's, even number of b's and a single c character.
Problem D: Oinkway Pig Latin is a language constructed by transforming English words. The following rules are used to translate English into Pig Latin: If the word begins with a consonant, then all consonants at the beginning of the word, up to the first vowel are removed then added to the end of the word, followed by "ay". For example, "computer becomes "omputercay" and "think" becomes "inkthay". If the word begins with a vowel, then "way" is added to the end of the word. For example, "algorithm" becomes "algorithmway" and "office" becomes "officeway". If the word ends in a punctuation mark, then the punctuation mark should remain at the end of the word after the transformation has been performed. For example, "science!" should become "iencescay!". You can assume that the punctuation mark is only a single character. Create a program that reads a line of text from the user, translates it into Pig Latin and then displays the result. Hint: Making a set of vowels and consonants of the…
For each one of the following languages over alphabet {a, b}, write an equivalent regular expression. (a) All strings made out of zero or more b's: (b) All strings that do not start with bb. (c) All strings that end with aaa or bb (d) All strings that start and end with the same alphabet letter.
Find two strings belong to the language represented by the following regular ?expressions * a(a|b)*a إجابتك * aa+bb إجابتك * *baa إجابتك *(ab+b) إجابتك
3. A palindrome is a sentence that contains the same sequence of letters read-ing it either forwards or backwards. A classic example is "Able was I, ere I saw Elba." Write a recursive function that detects whether a string is a palindrome. The basic idea is to check that the first and last letters of the string are the same letter; if they are, then the entire string is a palindrome if everything between those letters is a palindrome. There are a couple of special cases to check for. If either the first or last character of the string is not a letter, you can check to see if the rest of the string is a palindrome with that character removed. Also, when you compare letters, make sure that you do it in a case-insensitive way. Use your function in a program that prompts a user for a phrase and then tells whether or not it is a palindrome. Here's another classic for testing: "A man, a plan, a canal, Panama!"
Explain with an example the situation where using read() is appropriate andalso an example where readlines() is appropriate.
ASAP NLP!! Write regular expressions for the following languages. The set of all alphabetic strings end with a;
Can you please help me solve this in C language? I did encounter and solve this problem with Java but I cannot seem to implement the use of structures in solving this problem. Help is appreciated, thank you. Using the concept of structures, write a program to assign passenger seats in an airplane. Assume a small airplane with seats numbered as follows: 1 A B C D 2 A B C D 3 A B C D 4 A B C D 5 A B C D The program should display the seat pattern, marking with an ‘X’ the seats already assigned. For example, after seats 1A, 2B, and 4C are taken, the display should look like: 1 X B C D 2 A X C D 3 A B C D 4 A B X D 5 A B C D Seats are assigned by specifying a number and a letter. If the user types in a seat that is already assigned, the program should say that the seat is occupied and ask for another choice. The program should run until all seats are…
IN JS LANGUAGE Given the above parameters, implement a function that returns a string representing the plant (see the examples below for a better visualization). Examples plant("@", 3, 3, 25) "---@@@_@@@---@@@"