• Receiving the alphabet as £={a.b} from c • The user determines what the regular ex Finally produce the program code that

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...
icon
Related questions
Question
100%
Write the program by using this rules:
• Receiving the alphabet as £={a.b} from outside (separated by commas),
• The user determines what the regular expression will be,
• Finally, produce the program code that has the ability to produce the
language of L words and displays as many words as the user wants on
the screen.
• Note: It should check that the regular expression can be generated
from the alphabet!
• Note: The assignments that can check whether the given word
belongs to the L language will be given a bonus!
Example:
• Enter alphabet £={a,b<ENTER>}
• Enter the regular expression: (a+b)*a <ENTER>
• How many words of the L language do you want to see? :3 <ENTER>
• The regular expression can be generated from the £ alphabet. Your
words are listed. L={a,aa,ba}
BONUS: Enter the word to check: b <ENTER>
This word does not belong to the L language.
Please write C# Language.
Transcribed Image Text:Write the program by using this rules: • Receiving the alphabet as £={a.b} from outside (separated by commas), • The user determines what the regular expression will be, • Finally, produce the program code that has the ability to produce the language of L words and displays as many words as the user wants on the screen. • Note: It should check that the regular expression can be generated from the alphabet! • Note: The assignments that can check whether the given word belongs to the L language will be given a bonus! Example: • Enter alphabet £={a,b<ENTER>} • Enter the regular expression: (a+b)*a <ENTER> • How many words of the L language do you want to see? :3 <ENTER> • The regular expression can be generated from the £ alphabet. Your words are listed. L={a,aa,ba} BONUS: Enter the word to check: b <ENTER> This word does not belong to the L language. Please write C# Language.
Expert Solution
Step 1

Introduction

Automata is a kind of machine that has been demonstrated as 0's and 1's in which we can get our actual result from the abstract machine respectively.

 

steps

Step by step

Solved in 4 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY