Finiteness problem for regular languages, Theory of Computation

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.

Posted Date: 3/21/2013 1:53:59 AM | Location : United States







Related Discussions:- Finiteness problem for regular languages, Assignment Help, Ask Question on Finiteness problem for regular languages, Get Answer, Expert's Help, Finiteness problem for regular languages Discussions

Write discussion on Finiteness problem for regular languages
Your posts are moderated
Related Questions
So we have that every language that can be constructed from SL languages using Boolean operations and concatenation (that is, every language in LTO) is recognizable but there are r

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

A common approach in solving problems is to transform them to different problems, solve the new ones, and derive the solutions for the original problems from those for the new ones

Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

The computation of an SL 2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |- A and which starts with the in

what problems are tackled under numerical integration

S-->AAA|B A-->aA|B B-->epsilon