Demonstrate they are not regular languages

Job ID: 31407741

Budget: $10 – $30 USD

You have to demonstrate they are not regular languages.

It is recommended to use Pumping Lemma for doing that.

Recommended skills:
1. Automaton
2. Mathematics
3. Algorithm
4. Compiler
5. Programming paradigms
Related categories: Algorithm Mathematics