Please show that L is regular by creating a DFA- Consider the followin.pdf

•

0 likes•2 views

L is the language that contains strings with an equal number of r's separated by a single t character where the t is followed by a single character from the alphabet {a,b}. To show L is regular, a deterministic finite automata (DFA) that accepts this language can be constructed.

Education

Please show that L is regular by creating a DFA.
Consider the following language. L 1 = { rtr r , t { a , b } } Show that L is regular.

More from admin463580

Please solve the following problem: Create a program that allows discerning if the character (a single character) entered by the user through the console is a letter or a number. Subsequently, it must print on the screen if it is numeric or letter, using C language of programming. Remember that all characters have a defined position in the ascii table., This program must include the commands: int, float, scanf and operators that are relational and arithmetic..

Please solve the following problem- Create a program that allows disce.pdf

admin463580

Please solve Question 9- 8- P the.pdf

admin463580

Please show your work! Draw an UML class diagram showing the classes and relationships for the situations described below. Clearly identify the relationships as inheritance, association, aggregation etc. A Movie Theater screens many movies (at different times) and a movie can be shown in multiple theaters. A movie can be an animated movie or a live-action movie. A movie theater contains a box office where tickets are sold or reserved..

Please show your work! Draw an UML class diagram showing the classes.pdf

admin463580

Please simply answer the questions below using Internet research (Scholarly Research not necessary, but could be beneficial), Provide a figure, map, infographic, or chart for each question as well as a one paragraph (3-5 sentences) answer to the questions. HALO HYDROGEN HUB 1. What is the HALO Hydrogen Hub Project and who are the players? 2. How much Funding is expected for these projects and what is the timeline? 3. What is the IIJA and how is it related to the HALO Hydrogen Hub project? 4. What is a Hydrogen Hub? 5. What is Hydrogen Power and how does it work? 6. What does Hydrogen power cost to produce? How much does Hydrogen cost relative to gasoline? 7. How is Hydrogen stored, transported, and sold? 8. How is the HALO project expected to benefit Communities, Companies, Economies involved? 9. Who are the HALO Stakeholders and how will they contribute and benefit? 10. What are some risks and downsides for the Halo Hub Project? 11. Finally, what is your personal take on this project? 12. Bibliography and Links of sources..

Please simply answer the questions below using Internet research (Scho.pdf

admin463580

Please solve (b) The frequency distribution of heights of 100 college.pdf

admin463580

Please show the work for this question. The Voyager spacecraft has been transported by an alien being to the Delta Quadrant of space, millions of light-years from Earth. Captain Janeway and her crew are attempting to plot the shortest course home. Below is a network of the possible routes through the Delta Quadrant, where the nodes are different worlds/planetary systems and the values on the branches are the actual times, in years, between the nodes. a. Determine the shortest route from their present location (at node 1) to Earth (node 22). Do NOT find the permanent set; only the short route to Earth. b. When you are finished, give the total number of years it takes Voyager to reach Earth. Note: This problem is continued in Part Two of the problem set where you will use Excel to verify your solution..

Please show the work for this question- The Voyager spacecraft has bee.pdf

admin463580

please show the work to the numerical example i need help The Network.pdf

admin463580

please type all answers asap- i dont have figures- just do it without (1).pdf

admin463580

Please the following is the currency class of perious one. class Currency { protected: int whole; int fraction; virtual std::string get_name() = 0; public: Currency() { whole = 0; fraction = 0; } Currency(double value) { if (value < 0) throw "Invalid value"; whole = int(value); fraction = std::round(100 * (value - whole)); } Currency(const Currency& curr) { whole = curr.whole; fraction = curr.fraction; } /* This algorithm gets the whole part or fractional part of the currency Pre: whole, fraction - integer numbers Post: Return: whole or fraction */ int get_whole() { return whole; } int get_fraction() { return fraction; } /* This algorithm adds an object to the same currency Pre: object (same currency) Post: Return: */ void set_whole(int w) { if (w >= 0) whole = w; } void set_fraction(int f) { if (f >= 0 && f < 100) fraction = f; } /* This algorithm adds an object to the same currency Pre: object (same currency) Post: Return: */ void add(const Currency* curr) { whole += curr->whole; fraction += curr->fraction; if (fraction > 100) { whole++; fraction %= 100; } } /* This algorithm subtracts an object to the same currency Pre: object (same currency) Post: Return: */ void subtract(const Currency* curr) { if (!isGreater(*curr)) throw "Invalid Subtraction"; whole -= curr->whole; if (fraction < curr->fraction) { fraction = fraction + 100 - curr->fraction; whole--; } else { fraction -= curr->fraction; } } /* This algorithm compares the an object of the same currency for equality or inequality Pre: object (same currency) Post: Return: whole/fraction */ bool isEqual(const Currency& curr) { return curr.whole == whole && curr.fraction == fraction; } /* This algorithm compares the an object of the same currency to determine which is greater or smaller Pre: object (same currency) Post: Return: true/false */ bool isGreater(const Currency& curr) { if (whole < curr.whole) return false; if (whole == curr.whole && fraction < curr.fraction) return false; return true; } /* This algorithm prints the name and value of the currency object Pre: value of whole, fraction, and the name Post: whole, fraction, get_name() Return: */ void print() { std::cout << whole << "." << fraction << " " << get_name() << std::endl; } }; class Krone : public Currency { protected: /* This algorithm gets the name for the Currency. Pre: name - declared as string and initialized as Krone Post: Return: name */ std::string name = "Krone"; std::string get_name() { return name; } public: Krone() : Currency() { } Krone(double value) : Currency(value) { } Krone(Krone& curr) : Currency(curr) { } }; class Soum : public Currency { protected: /* This algorithm gets the name for the Currency. Pre: name - declared as string and initialized as Soum Post: Return: name */ std::string name = "Soum"; std::string get_name() { return name; } public: Soum() : Currency() { } Soum(double value) : Currency(value) { } Soum(Krone& curr) : Currency(curr) { } }; A LinkNode structure or class which will have two attrib.

Please the following is the currency class of perious one- class Curre.pdf

admin463580

Please trace the execution of the following solution to the Dining Philosopher problem. #define N ___ enum status(EATING, HUNGRY, THINKING}; monitor diningPhilosophers { status state[N]; condition self[N]; test(int i) { if((state[(i-1) mod N] != EATING) && (state[i] == HUNGRY) && (state[(i+1) mod N] != EATING)) { state[i] = EATING; self[i].signal(); } }; public: diningPhilosophers() { // Initilization for(int i = 0; i < N; i++) state[i] = THINKING; }; test(int i) { if((state[(i-1) mod N] != EATING) && (state[i] == HUNGRY) && (state[(i+1) mod N] != EATING)) { state[i] = EATING; self[i].signal(); }; }; public: diningPhilosophers() {...}; pickUpForks(int i) { state[i] = HUNGRY; test(i); if(state[i] != EATING) self[i].wait(); }; putDownForks(int i) { state[i] = THINKING; test((i-1) mod N); test((i+1) mod N); }; }.

Please trace the execution of the following solution to the Dining Phi.pdf

admin463580

please show elegoo arduino board setup using a passive buzzer. heres the code below: #define F_CPU 16000000 UL // CPU Frequency #include <avr/io.h> #include <util/delay.h> volatile uint8_t notePlaying = 0 ; void setup () { DDRB |= ( 1 << PB6 ) ; // Set PB6 as output TCCR1A = 0 ; // Clear Timer1 registers TCCR1B = 0 ; TIMSK1 = 0 ; OCR1A = 0 ; } void playNote ( uint16_t frequency) { if ( notePlaying ) { TCCR1B = 0 ; // Stop the timer notePlaying = 0 ; } else { // Calculate the prescaler value uint16_t prescaler = 1 ; while (( F_CPU / ( prescaler * frequency * 2 )) > 65535 ) { prescaler <<= 1 ; } // Configure Timer1 TCCR1B = ( 1 << WGM12 ) | ( prescaler & 0x 07 ) ; // Mode 4, prescaler OCR1A = ( F_CPU / ( prescaler * frequency * 2 )) - 1 ; // Output compare value TIMSK1 = ( 1 << OCIE1A ) ; // Enable compare match interrupt notePlaying = 1 ; // Start the timer TCNT1 = 0 ; TCCR1B |= ( 1 << CS10 ) | (( prescaler >> 1 ) & 0x 03 ) ; // Start timer } } ISR ( TIMER1_COMPA_vect ) { PORTB ^= ( 1 << PB6 ) ; // Toggle PB6 state } void loop () { if ( Serial . available () > 0 ) { char key = Serial . read () ; switch ( key ) { case 'A': playNote ( 440 ) ; break ; case 'B': playNote ( 494 ) ; break ; case 'C': playNote ( 523 ) ; break ; case 'D': playNote ( 587 ) ; break ; case 'E': playNote ( 659 ) ; break ; case 'F': playNote ( 698 ) ; break ; case 'G': playNote ( 784 ) ; break ; case 'q': TCCR1B = 0 ; // Stop the timer notePlaying = 0 ; break ; } } } #define F_CPU 16000000 UL // CPU Frequency #include <avr/io.h> #include <util/delay.h> volatile uint8_t notePlaying = 0 ; void setup () { DDRB |= ( 1 << PB6 ) ; // Set PB6 as output TCCR1A = 0 ; // Clear Timer1 registers TCCR1B = 0 ; TIMSK1 = 0 ; OCR1A = 0 ; } void playNote ( uint16_t frequency) { if ( notePlaying ) { TCCR1B = 0 ; // Stop the timer notePlaying = 0 ; } else { // Calculate the prescaler value uint16_t prescaler = 1 ; while (( F_CPU / ( prescaler * frequency * 2 )) > 65535 ) { prescaler <<= 1 ; } // Configure Timer1 TCCR1B = ( 1 << WGM12 ) | ( prescaler & 0x 07 ) ; // Mode 4, prescaler OCR1A = ( F_CPU / ( prescaler * frequency * 2 )) - 1 ; // Output compare value TIMSK1 = ( 1 << OCIE1A ) ; // Enable compare match interrupt notePlaying = 1 ; // Start the timer TCNT1 = 0 ; TCCR1B |= ( 1 << CS10 ) | (( prescaler >> 1 ) & 0x 03 ) ; // Start timer } } ISR ( TIMER1_COMPA_vect ) { PORTB ^= ( 1 << PB6 ) ; // Toggle PB6 state } void loop () { if ( Serial . available () > 0 ) { char key = Serial . read () ; switch ( key ) { case 'A': playNote ( 440 ) ; break ; case 'B': playNote ( 494 ) ; break ; case 'C': playNote ( 523 ) ; break ; case 'D': playNote ( 587 ) ; break ; case 'E': playNote ( 659 ) ; break ; case 'F': playNote ( 698 ) ; break ; case 'G': playNote ( 784 ) ; break ; case 'q': TCCR1B = 0 ; // Stop the timer notePlaying = 0 ; break ; } } } #define F_CPU 16000000 UL // CPU Frequency #include <avr/io.h> #include <util/delay.h> volatile uint8_t notePlaying = 0 ; void setup () { DDRB |= ( 1 << PB6 ) .

please show elegoo arduino board setup using a passive buzzer- heres t.pdf

admin463580

Please translate this into MIPS Assembly without using Psuedo-instruction. int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = (low -1); for (int j = low; j <= high - 1,j++) { if (arr[j] <= pivot) { i++ swap(&arr[i], &arr[j]); } } swap(&arr[i + 1], &arr[high]); return (i+1); } void quickSort (int arr[], int low, int high) { if (low < high) { int pi = partition(arr, low, high); quickSort(arr,low,pi - 1); quickSort(arr, pi + 1, high)" } } .

Please translate this into MIPS Assembly without using Psuedo-instruct.pdf

admin463580

More from admin463580 (12)