Now imagine that some students hold a protest on campus during the first week of Winter quarter. The following week, other students, who disagree with the protest, hold and anti-protest protest. The week after that, the students in the first group, upset with the anti-protest protesters, decide to protest against them, and hold an anti-anti-protest-protest protest. The week after that, the students in the second group take issue with that, and hold an anti-anti-anti-protest-protest- protest protest. This goes on for the entire quarter (including finals week), with a total of 11 protests. By spring break, both groups decide settle their differences amicably at the beach, and there are no more protests. Can the set of phrases that describes their protests, protests against protests, protests against protests against protests, and so on (i.e. L = {protest, anti-protest protest, anti-anti-protest-protest protest, anti-anti-anti-protest-protest-protest protest, anti-protest-protest-protest-protest-protest-protest-protest-protest-protest-protest protest}) be modeled by a finite-state machine? anti-anti-anti-anti-anti-anti-anti-anti-anti- .... O Yes. Because the weekly protests don't go on forever, L can be modeled using a finite-state machine. O No. Lis not a regular language, so it cannot be modeled by a fininte-state machine. Yes. Even though Lis not regular, it can be modeled by a finite-state machine. O No. Lis a regular language, but a machine would need to keep track of the number of "anti-" prefixes to have the right number of "protest", and that would require infinitely many states.

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...

Related questions

Question

Expert Solution

Step 1 ::

- We have to select what the language defined by the anti and protest define.

- The options ::

First option is because the weekly protest don't go forever. L can be modelled using a finite state machine. We need to have a count required in this problem. So, this option is incorrect.
Second option is L is not a regular language, so it cannot be modelled using a finite state machine. Yes, since we have to count in this problem, it is not regular and thus can't use finite automata. So, this option is correct.
Third option is even though L is not regular . It can be modelled using a finite state machine. Since, the language is not regular. It cannot use finite automata. So, this option is incorrect.
Fourth option is No, L is a regular language but a machine would need to keep track of number of "anti-" prefixes to have the right number of protests and that would require infinitely many states. As count is involved in this language, L is not regular. So, this option is incorrect.