subject

Using Pumping Lemma (slides 30-35 of the notes ‘Regular Languages & Finite Automata-IV’) one can show the language L= {a^n b^n | n ϵ N } is not regular (We need this property in the notes ‘Context-free Languages and Pushdown Automata I). This is done by way of contradiction. We assume L is regular. Since L is infinite, Pumping Lemma applies. We then consider the string s=a^m b^m where m is the number of states in the DFA that recognizes L. Since the length of s is bigger than m, by Pumping Lemma, there exists strings x, y and z such that s=xyz, y≠Λ, |xy|≤2m and xy^k z∈L for all k∈N. If |xy|<2m then the first repeated state on the acceptance path cannot be a final state. Is this statement true, why or why not?

ansver
Answers: 2

Other questions on the subject: Computers and Technology

image
Computers and Technology, 23.06.2019 18:30, DSUDLER5555
Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.
Answers: 3
image
Computers and Technology, 24.06.2019 04:30, andrespacheco5888
Which of the following terms refers to a collection of different types of software that share the goal of infiltrating a computer and making it do something? a- malware b- virus c- spyware d- trojan horse
Answers: 2
image
Computers and Technology, 24.06.2019 09:30, bhadd4385
What is the definition of digital literacy?
Answers: 1
image
Computers and Technology, 25.06.2019 05:00, adajadavis2843
Which of the following statements best deceive the relationship between carrying capacity and population size
Answers: 1
You know the right answer?
Using Pumping Lemma (slides 30-35 of the notes ‘Regular Languages & Finite Automata-IV’) one can...

Questions in other subjects:

Konu
Mathematics, 29.10.2020 03:10
Konu
Mathematics, 29.10.2020 03:10