TOC - Doubt

Question

TOC - Doubt

Sumit Singh Chauhan asked Aug 15, 2018

282 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

1

Mrityudoot asked Nov 8, 2023

142 views

Pumping Lemma
If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails) Can we conversely say for certain if L is not regular, then definitely there is a w’ ∉ L. Simply : Can there be a case where we have all w’ ∈ L and still language is not regular?

If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails)Can we conversely say for certain if L is not regular, then...

Mrityudoot

142 views

Mrityudoot asked Nov 8, 2023

0 votes

1 answer

2

shallowfalcon asked Oct 17, 2022

438 views

Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?

If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?

shallowfalcon

438 views

shallowfalcon asked Oct 17, 2022

The proof of the pumping lemma uses the pigeonhole principle.

Have a look here: https://courses.cs.washington.edu/courses/cse322/10sp/4-28-2010.pdf — goxul, Aug 15, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

TOC - Doubt

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments