Homework Help is Here – Start Your Trial Now!
Engineering
Electrical Engineering
5. Minimize the following DFA: to

5. Minimize the following DFA: to

Introductory Circuit Analysis (13th Edition)
Introductory Circuit Analysis (13th Edition)
13th Edition
ISBN:9780133923605
Author:Robert L. Boylestad
Publisher:Robert L. Boylestad
Chapter1: Introduction
Section: Chapter Questions
Problem 1P: Visit your local library (at school or home) and describe the extent to which it provides literature...
See similar textbooks
icon
Related questions
Question

Q5 solution needed 

1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers. 2. Write a regular expression that matches the following positive cases and does not match the following negative cases. Try to make the regular expression as general as possible. positive: 0, 10, 31, 1b, OB, 12x, 2aX, 1234567890, 11111000b, 123456789abcdefX, -0, -1b, -1bx negative: 00, 010, 31b, 1c, Od, xx, OcX, a, 2b, 3B, gX, -a, --1, 1-1 3. Translate the following regular expressions into one NFA: keywords: 0(12)*, number: [0123]+, special: 171? 4. Translate your NFA from task 3 to a DFA. Show all important steps. 5. Minimize the following DFA: a qo 6. (*) When you translate a regular expression to an NFA, and then to a DFA, and then minimize it - do you get a unique result? 7. (*) Translate the DFA from task 5 to a regular expression. Show all important steps. 8. Translate the following grammar to an NFA: A-> aB | bA | b, B-> aC | bB, C-> aA | bC|a 9. (*) Translate the following grammar to an NFA: E -> EOE| id, O-> +| -|*|/ 10. Translate the NFA from task 5 to a grammar.
Transcribed Image Text:1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers. 2. Write a regular expression that matches the following positive cases and does not match the following negative cases. Try to make the regular expression as general as possible. positive: 0, 10, 31, 1b, OB, 12x, 2aX, 1234567890, 11111000b, 123456789abcdefX, -0, -1b, -1bx negative: 00, 010, 31b, 1c, Od, xx, OcX, a, 2b, 3B, gX, -a, --1, 1-1 3. Translate the following regular expressions into one NFA: keywords: 0(12)*, number: [0123]+, special: 171? 4. Translate your NFA from task 3 to a DFA. Show all important steps. 5. Minimize the following DFA: a qo 6. (*) When you translate a regular expression to an NFA, and then to a DFA, and then minimize it - do you get a unique result? 7. (*) Translate the DFA from task 5 to a regular expression. Show all important steps. 8. Translate the following grammar to an NFA: A-> aB | bA | b, B-> aC | bB, C-> aA | bC|a 9. (*) Translate the following grammar to an NFA: E -> EOE| id, O-> +| -|*|/ 10. Translate the NFA from task 5 to a grammar.
Expert Solution
steps

Step by step

Solved in 5 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Introductory Circuit Analysis (13th Edition)
Introductory Circuit Analysis (13th Edition)
Electrical Engineering
ISBN:
9780133923605
Author:
Robert L. Boylestad
Publisher:
PEARSON
Delmar's Standard Textbook Of Electricity
Delmar's Standard Textbook Of Electricity
Electrical Engineering
ISBN:
9781337900348
Author:
Stephen L. Herman
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Electrical Engineering
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
Fundamentals of Electric Circuits
Fundamentals of Electric Circuits
Electrical Engineering
ISBN:
9780078028229
Author:
Charles K Alexander, Matthew Sadiku
Publisher:
McGraw-Hill Education
Electric Circuits. (11th Edition)
Electric Circuits. (11th Edition)
Electrical Engineering
ISBN:
9780134746968
Author:
James W. Nilsson, Susan Riedel
Publisher:
PEARSON
Engineering Electromagnetics
Engineering Electromagnetics
Electrical Engineering
ISBN:
9780078028151
Author:
Hayt, William H. (william Hart), Jr, BUCK, John A.
Publisher:
Mcgraw-hill Education,
SEE MORE TEXTBOOKS