Answer:
I will show that this language is regular because it can be described by a regular expression and a FA (NFA)
Explanation:
The regular expression for the language is: (1⁺0*1⁺)* + (0⁺1*0⁺)*
NFA and DFA diagram chat that show that L2 is a regular language as shown below. at every loop, the language L2 comfortably repeats itself.
<h3>
<u>Travelling is good as reading</u>
, as it provides you with the practical knowledge of a particular place. It also gives you knowledge, about various things and also makes you understand the beauty of nature, along with it also give you an idea of different lifestyles of every people belonging to different religions.</h3>
As we know, each and every piece of information that we want to know are easily available in books and the internet. But most of us haven't seen it practically, because we are so much dependable on these things that our practical knowledge is zero. So, it is quite necessary for every one of us to get knowledge both in text and practically. So, that we can get to know each and everything in a prescribed manner.
reference link-
traveling is as good as reading books and essays - Brainly.inhttps://brainly.in
#p12
Can you give some information , what book?
