Scribd
Upload
27 views

Lecture11 9up

This document discusses techniques for proving that a language is not regular, specifically using the pumping lemma for regular languages. It explains that the pumping lemma can be used to show that if a language contains words that cannot be split into three parts to satisfy the pumping lemma conditions, then the language cannot be regular. It also lists regular languages, Chomsky hierarchy and the pumping lemma as topics covered and provides recommendations for further reading on these subjects.

Uploaded by

SriNi VaSan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
27 views

Lecture11 9up

This document discusses techniques for proving that a language is not regular, specifically using the pumping lemma for regular languages. It explains that the pumping lemma can be used to show that if a language contains words that cannot be split into three parts to satisfy the pumping lemma conditions, then the language cannot be regular. It also lists regular languages, Chomsky hierarchy and the pumping lemma as topics covered and provides recommendations for further reading on these subjects.

Uploaded by

SriNi VaSan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages G52MAL Machines and their Languages Lecture 11: Proving Languages not to be Regular
The Regular Languages are those that can be recognised by nite automata. Neil Sculthorpe
Room A04 School of Computer Science University of Nottingham United Kingdom [email protected]

Regular Languages

The Regular Languages are those that can be recognised by nite automata. Such machines have a nite number states (i.e. nite memory).

28th February 2011

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Regular Languages

The Chomsky Hierarchy

Proving Languages not to be Regular

All languages Recursively Enumerable Languages (Type 0) Turing Machines Total Turing Machines / Deciders Linear-Bounded Turing Machines Pushdown Automata Finite Automata

The Regular Languages are those that can be recognised by nite automata. Such machines have a nite number states (i.e. nite memory). But many languages are not regular.

Recursive/Decidable Languages Context-Sensitive Languages (Type 1) Context-Free Languages (Type 2) Regular Languages (Type 3)

How do we prove a language is not regular?

G52MAL: Machines and their Languages Regular Languages

L11: Proving Languages not to be Regular The Pumping Lemma Regular Languages

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular The Pumping Lemma Regular Languages

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular The Pumping Lemma

Chomsky Hierarchy

Chomsky Hierarchy

Chomsky Hierarchy

Proving Languages not to be Regular

Proving Languages not to be Regular

The Pumping Lemma for Regular Languages

How do we prove a language is not regular? One technique: Using The Pumping Lemma

How do we prove a language is not regular? One technique: Using The Pumping Lemma Basic idea: Exploit the fact that, for any Regular Language, suciently long words are repetitive.

Given a regular language L, there exists an n N such that all w L of length at least n can be split into three words (w = xyz) satisfying: y = |xy | n k N. xy k z L

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

Regular Languages

Chomsky Hierarchy

The Pumping Lemma

Recommended Reading

Introduction to Automata Theory, Languages, and Computation (3rd edition), pages 127131 G52MAL Lecture Notes, pages 2931

G52MAL: Machines and their Languages

L11: Proving Languages not to be Regular

You might also like