I have to prove with the pumping lemma that $L$ is not regular or to give a regular expression for that. Let $L$ be all combinations of commands such that in the complete drawn result no line is drawn above another. At the starting point the pen is down.  The turtle graphic is created by the following commands: u - pen upd - pen downg - go l - move 10 leftr - move 10 rightI think think that the language is not regular because I think there is an expression that crosses a line for a big enough $n \in \mathbb N$.Question: How can I find an expression that helps me to prove that this language is not regular to use the pumping lemma?And if the language is regular, what technique should I use to find a regular expression?
How to show that a turtle graphic language is not regular?
formal languages;automata;regular languages;pumping lemma