Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that \(\left\{ {{{\bf{0}}^{{{\bf{2}}^{\bf{n}}}}}\mid {\bf{n}} \in {\bf{N}}} \right\}\) is not regular. You may use the pumping lemma given in Exercise \(22\) of Section \({\bf{13}}.{\bf{4}}\).

Short Answer

Expert verified

Prove \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is not regular by using a proof by contradiction.

Step by step solution

01

Definition

Pumping lemma: If \(x\) is a string in \(L(M)\) with \(L{\rm{(}}x{\rm{)}} \ge |S|\), then there are strings \(u,{\bf{ }}v\) and \(w\) in \({I^*}\) such that \(x = u,v,w\), \(L{\rm{(}}uv{\rm{)}} \le |S|\) and \(l{\rm{(}}v{\rm{)}} \ge 1\) and \(u{v^i}w \in L{\rm{(}}M{\rm{)}}\) for \(i = 0,1,2, \ldots \)

02

Proving by contradiction

Given:

\(M = \left( {S,I,f,{s_0},F} \right)\)is a deterministic finite-state automaton

\(L(M)=\) Language recognized by \(M\)

To proof: \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is not regular

PROOF BY CONTRADICTION

Let us assume, for the sake of contradiction, that \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is regular.

Since \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is regular, there exists some deterministic finite-state automaton \(M = \left( {S,I,f,{s_0},F} \right)\) that generates \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\).

Let \(k = \left| S \right|\). Let us consider the string \(x = {0^{{2^k}}}\).

\(\begin{array}{c}l\left( {{0^{{2^k}}}} \right) = {2^k} \ge 2k\\ = 2|S| \ge |S|\end{array}\)

03

Using the pumping lemma

By the pumping lemma, there then exist strings \(u,v\) and \(w\) in \({I^*}\) such that \(x = uvw,L{\rm{(}}uv{\rm{)}} \le |S|\) and \(l{\rm{(}}v{\rm{)}} \ge 1\) and \(u{v^i}w \in L{\rm{(}}M{\rm{)}}\) for \(i = 0,1,2, \ldots \).

Let \(v\) consist of \(m\) zeros with \(m\) a positive integer, thus \(v = {0^m}\).

However, then \(M\) also generates \({0^{2{\bf{ }}k + p{\bf{ }}m}}\) for all positive integers \(p\) (as \(u{v^i}w \in L{\rm{(}}M{\rm{)}}\)). This then implies that \(2{\bf{ }}k + p{\bf{ }}m\) is a power of \(2\) for all positive integers \(p\).

This is impossible, because the difference between successive powers of \(2\) increases more and more, while the difference between successive terms \(2{\bf{ }}k + p{\bf{ }}m\) increases consistently by \(m\), and thus at some point one of the elements \(2{\bf{ }}k + p{\bf{ }}m\) is not a power of \(2\). Thus, you have derived a contradiction. This then implies that our assumption " \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is regular" is incorrect and thus \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is not regular.

Therefore, the given \(\left\{ {{0^{{2^n}}}\mid n = 0,1,2, \ldots } \right\}\) is not regular.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

a) Show that the grammar \({{\bf{G}}_{\bf{1}}}\) given in Example 6 generates the set\({\bf{\{ }}{{\bf{0}}^{\bf{m}}}{{\bf{1}}^{\bf{n}}}{\bf{|}}\,{\bf{m,}}\,{\bf{n = 0,}}\,{\bf{1,}}\,{\bf{2,}}\,...{\bf{\} }}\).

b) Show that the grammar \({{\bf{G}}_{\bf{2}}}\) in Example 6 generates the same set.

Use Backusโ€“Naur form to describe the syntax of expressions in infix notation, where the set of operators and identifiers is the same as in the BNF for postfix expressions given in the preamble to Exercise 39, but parentheses must surround expressions being used as factors.

A palindrome is a string that reads the same backward as it does forward, that is, a string w, where \({\bf{w = }}{{\bf{w}}^{\bf{R}}}\), where \({{\bf{w}}^{\bf{R}}}\) is the reversal of the string w. Find a context-free grammar that generates the set of all palindromes over the alphabet {0, 1}.

In Exercises 43โ€“49 find the language recognized by the given nondeterministic finite-state automaton.

let \({{\bf{G}}_{\bf{1}}}\) and \({{\bf{G}}_{\bf{2}}}\) be context-free grammars, generating the language\({\bf{L}}\left( {{{\bf{G}}_{\bf{1}}}} \right)\) and \({\bf{L}}\left( {{{\bf{G}}_{\bf{2}}}} \right)\), respectively. Show that there is a context-free grammar generating each of these sets.

a) \({\bf{L}}\left( {{{\bf{G}}_{\bf{1}}}} \right){\bf{UL}}\left( {{{\bf{G}}_{\bf{2}}}} \right)\)

b) \({\bf{L}}\left( {{{\bf{G}}_{\bf{1}}}} \right){\bf{L}}\left( {{{\bf{G}}_{\bf{2}}}} \right)\)

c) \({\bf{L}}{\left( {{{\bf{G}}_{\bf{1}}}} \right)^{\bf{*}}}\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free