Finiteness problem for regular languages, Theory of Computation

Assignment Help:

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length greater than n (where n is the number of states in the minimal DFA recognizing this language and, therefore, no greater than the number of states in this particular DFA) can be split into three components uvw, where |v| > 0 and uviw ∈ L(A) for all i ≥ 0. One consequence of this is that L(A) will be non-empty iff it includes some string of length strictly less than n. To see this, assume (for contradiction) that no string in L(A) was of length less than n. Let x be a minimal length string in L(A), so no string in A is shorter than x. By our assumption |x| ≥ n. Then the pumping lemma applies and x must have the form uvw, etc. But then uw ∈ L(A) also and |uw| < |uvw| contradicting the choice of x as a minimal length string. Hence the shortest string in L(A), whatever it is, must have length strictly less than n. To decide Emptiness, then, all we need to do is to systematically generate all strings in Σ∗ with length less than n (the de?nition of Σ∗ provides the foundation of an algorithm for doing this) and check to see if A accepts any of them. We return "True" iff it accepts at least one. (Thus, the Emptiness Problem reduces to the Recognition Problem.)

Theorem (Finiteness) The Finiteness Problem for Regular Languages is decidable.


Related Discussions:- Finiteness problem for regular languages

Strictly local languages, While the SL 2 languages include some surprising...

While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless

Construct a recognizer, Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG t...

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Positiveness problem - decision problems, For example, the question of whet...

For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable. "Positiveness Problem". Note that

Emptiness problem, The Emptiness Problem is the problem of deciding if a gi...

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

Tuning machine, design a tuning machine for penidrome

design a tuning machine for penidrome

Answer, And what this money. Invovle who it involves and the fact of,how we...

And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v

Operator p, implementation of operator precedence grammer

implementation of operator precedence grammer

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd