Chapter 2: Q57P (page 160)

Let B= $\{a^{i} b^{j} c^{k} i, j, k \geq 0 a n d i = j o r i = k\}$ . Prove that B is not a DCFL.

Short Answer

Expert verified

It can be proved that B is not a deterministic Context-free Language.

Step by step solution

Explain DCFL.

Deterministic Context Free Languages are accepted by the deterministic pushdown automaton. DCFL is an unambiguous and accept an unambiguous grammar. Deterministic Pushdown Automata is used to recognizes the DCFL.

Prove that B is not a DCFL.

Consider that the language B is a context free and if it is deterministic context free then $B = \{a, b, c\} * - B$ is deterministic context free.

Thus, $B = \{a^{i} b^{j} c^{k} i, j, k \geq 0 a n d i = j o r i = k\}$ is not context free.

Consider $B \cap \{a, b, c\} * - B_{i}$ ,If $B$ is a DCFL, then it must be a CFL. If $B$ is CFL, then by intersection the regular language is a CFL. This, in contradiction shows that B is not a Deterministic Context free language.

Therefore, It has been proved that is B not a deterministic Context-free Language.

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.

Start your free trial

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

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Let B= $\{a^{i} b^{j} c^{k} i, j, k \geq 0 a n d i = j o r i = k\}$ . Prove that B is not a DCFL.

Short Answer

Step by step solution

Explain DCFL.

Prove that B is not a DCFL.

One App. One Place for Learning.

Most popular questions from this chapter

Recommended explanations on Computer Science Textbooks

Databases

Computer Systems

Big Data

Computer Programming

Computer Organisation and Architecture

Issues in Computer Science

Study anywhere. Anytime. Across all devices.

Let B=aibjcki,j,k≥0andi=jori=k. Prove that B is not a DCFL.

Short Answer

Step by step solution

Explain DCFL.

Prove that B is not a DCFL.

One App. One Place for Learning.

Most popular questions from this chapter

Recommended explanations on Computer Science Textbooks

Databases

Computer Systems

Big Data

Computer Programming

Computer Organisation and Architecture

Issues in Computer Science

Study anywhere. Anytime. Across all devices.

Let B= $\{a^{i} b^{j} c^{k} i, j, k \geq 0 a n d i = j o r i = k\}$ . Prove that B is not a DCFL.