Prof. has installed a meme vending machine a machine that will accept coins and dispense a meme - in the class. It accepts any amount of money in pennies (p), nickels (n), and dimes (d) as long as the coins are deposited in non-decreasing order of values. For example, a meme will be dispensed by the machine if the user deposits coins in the order described by the following strings: ppp, n, nd, pnd, pppnndd, d. A meme would not be dispensed by the machine if the user deposits coins in the order described by the following strings: ndp, dp, pnp, ddnn. Consider the alphabet of pennies, nickels, and dimes as E₂ = {p, n, d} where p denotes a Σ2 penny, n denotes a nickel, and d denotes a dime. Let L2 be the language over Σ2 such that L₂= {w coins deposited in the order described in w would dispense a meme.} Therefore, the strings ppp, n, nd, pnd, pppnndd, d are in L2 and strings ndp, dp, pnp, ddnn are not in L₂. 1. Give a regular expression that describes all the strings in the language L₂. 2. Give a regular expressions that describes all the strings not in L₂. 3. Design a DFA or NFA that recognizes the langauge L2.

Prof. has installed a meme vending machine a machine that will accept coins and dispense a meme - in the class. It accepts any amount of money in pennies (p), nickels (n), and dimes (d) as long as the coins are deposited in non-decreasing order of values. For example, a meme will be dispensed by the machine if the user deposits coins in the order described by the following strings: ppp, n, nd, pnd, pppnndd, d. A meme would not be dispensed by the machine if the user deposits coins in the order described by the following strings: ndp, dp, pnp, ddnn. Consider the alphabet of pennies, nickels, and dimes as E₂ = {p, n, d} where p denotes a Σ2 penny, n denotes a nickel, and d denotes a dime. Let L2 be the language over Σ2 such that L₂= {w coins deposited in the order described in w would dispense a meme.} Therefore, the strings ppp, n, nd, pnd, pppnndd, d are in L2 and strings ndp, dp, pnp, ddnn are not in L₂. 1. Give a regular expression that describes all the strings in the language L₂. 2. Give a regular expressions that describes all the strings not in L₂. 3. Design a DFA or NFA that recognizes the langauge L2.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

JAVA write grading program for a class with the following grading policies. thers a total of 2 quizzes, each graded on the basis of 10 points. theeres is 1 midterm exam and one final exam, each graded on the basis of 100 points. final exam counts for 50% of the grade, the midterm counts for 25%, and the 2 quizzes together count for a total of 25%. (Do not forget to normalize the quiz scores.) letter grade will be given based on the following criterion: 90 – 100 A 80 – 89 B 70 – 79 C 60 – 69 D 0 – 59 E program will read student’s scores from a txf file, save them in an arrayor arrays), process the arrays), print the student’s record, which consists of the name, 2 quiz and 2 exam scores as well along with students avg numscore for the course and final letter rade. please noteAll the scores are integers and a student name consists of no more than 10 characters. justify output file
What is printed by the function foo5()?class Point:def __init__(self, x, y):self.x = xself.y = ydef diff(self, p):self.x = self.x - p.xself.y = self.y - p.ydef show(self):print(self.x, self.y)def foo5():p1 = Point(4, 5)p2 = Point(7, 8)p3 = Point(2, 1)p2.diff(p1)p2.diff(p3)p2.show()p3.show()
Write a Java program (Hangman.java) to play the classic word game Hangman. In the game, a word is randomly selected from an array of possible words. Then, the user is prompted to guess letters in the word one at a time. When the user makes a correct guess, all instances of that letter in the word are shown. When all letters in the word have been guessed, the game ends and the score (number of missed guesses) is displayed. A user can play the game multiple times if they choose. Here is a sample run of a correct program (user input indicated by orange text):Enter a letter in word ******** > cEnter a letter in word c******* > rEnter a letter in word c******r > s s is not in the wordEnter a letter in word c******r > tEnter a letter in word c****t*r > mEnter a letter in word c*m**t*r > t t is already in the wordEnter a letter in word c*m**t*r > pEnter a letter in word c*mp*t*r > oEnter a letter in word comp*t*r > eEnter a letter in word comp*ter >…
In this problem you will fill out three functions to complete the Group ADT and the Diner ADT. The goal is to organize how diners manage the groups that want to eat there and the tables where these groups sit. It is important to take the time to read through the docstrings and the doctests. Additionally, make sure to not violate abstraction barriers for other ADTS, i.e. when implementing functions for the Diner ADT, do not violate abstraction barriers for the Group ADT, and vice versa. # Diner ADT def make_diner (name): """ Diners are represented by their name and the number of free tables they have.""" return [name, 0] def num_free_tables (diner): return diner [1] def name (diner): return diner [0] # You will implement add_table and serve which are part of the Diner ADT # Group ADT def make_group (name): Groups are represented by their name and their status.""" return [name, 'waiting'] |||||| def name (group): return group [0] def status (group): return group [1] def start_eating…
The Delicious class – iterative methods The Delicious class must:• Define a method called setDetails which has the following header: public void setDetails(String name, int price, boolean available) This must find in the ArrayList the Chicken with the given name, change itspricePerKilo to the given price parameter and set whether it is in stock or not. A value of true for the available parameter means the chicken is in stock and a value of false means it is sold out (not in stock). Note that there will only be at most one Chicken object of the given name stored in the ArrayList.• Define a method called removeChicken that takes a single String parameter representing a chicken’s name. This method must remove from the ArrayList the Chicken object (if any) with the given name. The method must return true if a cheese with the given name was found and removed, and false otherwise.The Delicious class – challenge method In the Delicious class complete the findClosestAvailable method: This…
In python and include doctring: First, write a class named Movie that has four data members: title, genre, director, and year. It should have: an init method that takes as arguments the title, genre, director, and year (in that order) and assigns them to the data members. The year is an integer and the others are strings. get methods for each of the data members (get_title, get_genre, get_director, and get_year). Next write a class named StreamingService that has two data members: name and catalog. the catalog is a dictionary of Movies, with the titles as the keys and the Movie objects as the corresponding values (you can assume there aren't any Movies with the same title). The StreamingService class should have: an init method that takes the name as an argument, and assigns it to the name data member. The catalog data member should be initialized to an empty dictionary. get methods for each of the data members (get_name and get_catalog). a method named add_movie that takes a Movie…
A java generic class called Validator stores requirements for user input and provides a method, boolean isValid(input), that determines if the provided input meets the requirements. The data type of input will either be String or Boolean depending on the type of data the validator accepts. The Validators that your system will need, and their requirements, are as follows: Password-A password is a String has the following properties: Minimum and maximum acceptable length (inclusive). The minimum number of lowercase letters that the password must contain (default = 0, which means that lowercase letters are not required). The minimum number of uppercase letters that the password must contain (default = 0). The minimum number of digits that the password must contain (default = 0). To be valid, a password must meet the length requirements and contain at least the minimum number of each character type. Additionally, a valid password cannot contain a space (“ “). To keep things…
Using javascript getElementByClass- write a simple programe whereby each time a player gets shot by a bullet, the player loses a life and a 'live' is remove from the three 'lives'.If the player loses all three lives, display and print 'game over'.Display 'play again' message to restart th game. <ul class = "lives"> <li></li> <li></li> <li></li> </ul>
Java - Car Value (Classes)
/*** This class describes a tweet. A tweet has a message in it, a unique ID,* a count of the number of likes, and a count of the number of times it* has been retweeted. In addition, the Tweet class will have a static * variable to count the total number of tweets to ever be created * (retweets don't count as a new tweet).* * You may NOT import any library class.* * **/public class Tweet { /*** This constructor creates a tweet with the given message.* Assume that the message is not null because only the tweet() method* from the TwitterUser class will call this constructor. There are* no length requirements on Tweets.* * The very first tweet to ever be created will have an ID of 0, the * next one will have 1, and so on and so forth. It may help you to use* the static count variable to set the ID. * * You will have to initialize other instance variables appropriately.* @param message the text of the tweet*/public Tweet(String message) {throw new UnsupportedOperationException("Implement…