1. Using the method described in Section 9.1 and in class convert the following regular expression into a state diagram: (01* + 10)*1* Note that the closure operation has highest precedence (see page 164 in the text). Thus the expression 01* denotes exactly one 0 followed by any number of 1's. Your answer should indicate how you arrived at the result: • As intermediate steps write down the state diagrams that you construct for subex- pressions of the given regular expression, and for each intermediate step clearly indicate which subexpression it corresponds to.

1. Using the method described in Section 9.1 and in class convert the following regular expression into a state diagram: (01* + 10)1 Note that the closure operation has highest precedence (see page 164 in the text). Thus the expression 01* denotes exactly one 0 followed by any number of 1's. Your answer should indicate how you arrived at the result: • As intermediate steps write down the state diagrams that you construct for subex- pressions of the given regular expression, and for each intermediate step clearly indicate which subexpression it corresponds to.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

This is a fill in the Blank question. Students will see an empty textbook to type their answer. In the following, x and y are variables, A and B are constants. Fill in the correct substitution such that each of a(A, x) and a(y, B) will be the same expression (this process is called Unification). SUBST{X/ , y/
Part IV An early method of telegraph communication was based on the Morse code. This code uses patterns of short and long pulses to represent a message. Each letter is represented as a sequence of dots (a short pulse), and dashes (a long pulse). For example, the first eight letters of the alphabet have the following representation: A In HDL Verilog В C D E F G H Design and implement a circuit that takes as input one of the first eight letters of the alphabet and displays the Morse code for it on a red LED. Your circuit should use switches SW2-o and pushbuttons KEY1 a user presses KEY1, the circuit should display the Morse code for a letter specified by SW2-0 (000 for A, 001 for B, etc.), using 0.5-second pulses to represent dots, and 1.5-second pulses to represent dashes. Pushbutton KEY, should function as an asynchronous reset. A high-level schematic diagram of the circuit is shown in Figure 2. (1-0 as inputs. When Hint: Use a counter to generate 0.5-second pulses, and another counter…
code in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {},and (). A matching pair of brackets is not balanced if the set of brackets it encloses are not matched. For example, {[(])} is not balanced because the contents in between { and } are not balanced. Write a program that take string of bracket pairs from user and reply Yes or No after evaluate. Your program should working like This. {[()]} Yes {[(])} No {{[[(())]]}} Yes
Assume you are writing code to maintain a linked list. You are to use a variable named head to always point to the first node in the list and the variable named tail to always point to the last node in the list. Write the Java statements required to accomplish each of the following actions given the Node definition above. For the following questions, provide both the lines of code to accomplish the required task (given the restrictions above), and a diagram showing the state of the linked list after all your lines of code (in each question) have been executed. (a) Create a linked list with just a single node that has the value 5 in it. (b) Create and append a node with the value 10 to the end of the list in la above. (c) Using a loop construct of your choice, provide the lines of code required to add nodes with the values 15, 20, 25, 30, 35 and 40 in that order to the end of the list in 1b above. (d) Add a node with the value 12 to the list in 1c in its proper position assuming the…
Regular expression to NFA to DFA conversion: Describes the process of taking a unique regular expression, converting that regular expression to an NFA, then converting the NFA into a DFA. Your regular expression must have at minimum two union, two concatenation, and two Kleene star operations. As followed, concatenations of single charaters can be condensed. Your regular expression cannot be a solved problem from any book. You should describe the regular expression with both processes to convert the regular expression to an NFA and the conversion of that NFA into a DFA.
Mixed Fraction Arithmetic Java Project: Problem Description: Make a java program that facilitates addition, subtraction, multiplication, and division of mixed numbers (similar with the first activity) but this time all of the inputs /outputs may involve fractions, mixed fractions, or a combination. Points to consider: MixedFraction class must override the operations (add, subtract, multiplyBy, divideBy) inherited from Fraction class to have a different implementation if the MixedFraction object will have a Fraction object as parameter in performing the required operation, On top of that, the inherited operations must also be overloaded to allow a MixedFraction object to accept other parameters such as a whole number or another MixedFraction object. The toString method which is inherited must also be overridden by MixedFraction to have a more appropriate return value. Further formatting must also be considered such that if the result of the operation has a zero value for the whole…
Assume you are writing code to maintain a linked list. You are to usea variable named head to always point to the first node in the list and the variable named tail to always point to the last node in the list. Write the Java statements required to accomplish each of the following actions given the Node definition above. For the following questions, provide both the lines of code to accomplish the required task (given the restrictions above), and a diagram showing the state of the linked list after all your lines of code (in each question) have been executed. (a) Create a linked list with just a single node that has the value 5 in it. (b) Create and append a node with the value 10 to the end of the list in 1aabove.(c) Using a loop construct of your choice, provide the lines of code requiredto add nodes with the values 15, 20, 25, 30, 35 and 40 in that order to the end of the list in 1b above. (d) Add a node with the value 12 to the list in 1c in its proper positionassuming the list…
Need help with this Java review If you can also send a screenshot will be helpful to understan Objective: The purpose of this lab exercise is to create a Singly Linked List data structure . Please note that the underlying implementation should follow with the descriptions listed below. Instructions : Create the following Linked List Data Structure in your single package and use "for loops" for your repetitive tasks. Task Check List ONLY "for" loops should be used within the data structure class. Names of identifiers MUST match the names listed in the description below. Deductions otherwise. Description The internal structure of this Linked List is a singly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node in…
java program that shows exact output as picture program that asks the user to enter a number to be tested for repeated digits. For each input number from the user, the program prints a table showing how many times each digit appears in the number. Let’s assume that the appearance of a digit will not be over 1000 times in the input. Make sure your table printout can align well. The program should terminate when the user enters a number that is less than or equal to 0. A sample output is shown in the attachment.
c++ or java or in pseudo code with explaining note: if anything is unclear or seems left out make an assumption and document your assumption Implement an algorithm for assigning seats within a movie theater tofulfill reservation requests. Assume the movie theater has the seatingarrangement of 10 rows x 20 seats, as illustrated to the below.The purpose is to design and write a seat assignmentprogram to maximize both customer satisfaction and customersafety. For the purpose of public safety, assume that a buffer of three seats inbetween Input DescriptionYou will be given a file that contains one line of input for eachreservation request. The order of the lines in the file reflects the order inwhich the reservation requests were received. Each line in the file will becomprised of a reservation identifier, followed by a space, and then thenumber of seats requested. The reservation identifier will have theformat: R####. See the Example Input File Rows section for anexample of the input…