Hi, there, here are some questions about "Limitations", "grammar" of regular language in theory of computation:

1.Prove that this language on S ={0, 1} L = {ww : w {0, 1}*} is not a regular language.

2.Explain what the following statement means and give an example. A regular grammar is a subset of context-free-grammar.

3.Explain the limitation of regular languages. Give an example of a language that is not regular and explains where the core of difficulty for not regularity is?