Let the following languages Li be given over the alphabet 2= {0, I, 2}. %3D . Li - u.2 |υε Σ' %3D . L(1l . υ | υ ε Σ! • L3 = {2"10" | n e N} %3D • L4 = {0"12n+m | n, m E N} %3D

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
Let the following languages Li be given over the alphabet E = {O, I, 2}.
. L1-u-2 | υε Σ')
. L- 11 . υ | υ ε Σ}
V
• L3 = {2"10" | n € N}
• L4 = {0"12"+m | n, m E N}
Subtask (a)
Answer the following question and give a reason for your answer. Which of these
languages Li has a Nerode index greater than or equal to three?
Subtask (b)
Reason that the two languages LI and L2 have a finite Nerode index.
Subtask (c)
In order to justify that the language L3 has an infinite Nerode index, one must specify an infinite number of character strings uj from
E* to which different sets of suffixes SL3 (uj) are assigned in pairs.
For this purpose it is advisable to choose the character string uj = 2-1 for each je IN.
Answer the following questions.
(i) State how many and which character strings from E*the one
String contains the suffix set ŞL3 (uj) assigned to uj.
Kii) Explain why it follows from j1 #ja that the suffix sets assigned to the two strings ujl and uj2 are different, ie. H. that SL3
ujil ESL3 (uja) holds
Subtask (d)
Explain why the language L4 has an infinite Nerode index.
Hint: Select - in analogy to subtask (c) - an infinite number of strings uj and explain why the strings you have selected
are assigned different sets of suffixes SL4 (uj) in pairs
Transcribed Image Text:Let the following languages Li be given over the alphabet E = {O, I, 2}. . L1-u-2 | υε Σ') . L- 11 . υ | υ ε Σ} V • L3 = {2"10" | n € N} • L4 = {0"12"+m | n, m E N} Subtask (a) Answer the following question and give a reason for your answer. Which of these languages Li has a Nerode index greater than or equal to three? Subtask (b) Reason that the two languages LI and L2 have a finite Nerode index. Subtask (c) In order to justify that the language L3 has an infinite Nerode index, one must specify an infinite number of character strings uj from E* to which different sets of suffixes SL3 (uj) are assigned in pairs. For this purpose it is advisable to choose the character string uj = 2-1 for each je IN. Answer the following questions. (i) State how many and which character strings from E*the one String contains the suffix set ŞL3 (uj) assigned to uj. Kii) Explain why it follows from j1 #ja that the suffix sets assigned to the two strings ujl and uj2 are different, ie. H. that SL3 ujil ESL3 (uja) holds Subtask (d) Explain why the language L4 has an infinite Nerode index. Hint: Select - in analogy to subtask (c) - an infinite number of strings uj and explain why the strings you have selected are assigned different sets of suffixes SL4 (uj) in pairs
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

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