S -> ""meaning that S returns the empty string. I understand that the empty collection and empty string are not the very same. According to my professor, the answer is:
S -> SNow, that answer appears strange to me:It will certainly never before terminate.It isn"t so a lot a language as the absence of one.
You are watching: Is the empty set a regular language
I understand also from a strictly mathematical standsuggest, I"m not going to acquire all over through number 2. However before, is it compelled for a language to terminate? Having a language that CAN go on forever sounds okay, but one that never before will certainly terminate sounds wrong enough that I assumed I"d ask if anyone knows if that"s a language necessity or not.
From the Formal Grammar Wikipedia page:
the language of G, denoted as L(G), is characterized as all those sentences that deserve to be obtained in a finite number of actions from the begin symbol S.
Starting through S, applying the production ascendancy when to S provides S. Applying the preeminence twice provides S. By induction, applying the dominance any type of finite number still gives S. Because no sentences deserve to be acquired in a finite number of steps, the language is empty, so your professor is correct.
Alternative means to specify a grammar that accepts the empty set are L(G) = (the language is empty) or P = (the collection of production rules is empty).
Thanks for contributing a solution to Stack Overflow!Please be certain to answer the question. Provide details and also share your research!
But avoid …Asking for assist, clarification, or responding to other answers.Making statements based on opinion; ago them up through recommendations or personal suffer.
See more: Tear Vs Tare It Up Or Tear It Up, Tare Vs Tear Vs Tears Vs Tier
To learn more, check out our tips on composing great answers.
Post Your Answer Discard
By clicking “Article Your Answer”, you agree to our regards to business, privacy plan and also cookie plan
Not the answer you're looking for? Browse other inquiries tagged grammar context-free-grammar or ask your own question.
website architecture / logo © 2021 Stack Exreadjust Inc; user contributions licensed under cc by-sa. rev2021.9.2.40142