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
c program to convert dfa to re

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

Define the following concept with an example: a.    Ambiguity in CFG b.    Push-Down Automata c.    Turing Machine

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

Ask queyystion #Minimum 100 words accepted#

how to understand DFA ?

De?nition Deterministic Finite State Automaton: For any state set Q and alphabet Σ, both ?nite, a ?nite state automaton (FSA) over Q and Σ is a ?ve-tuple (Q,Σ, T, q 0 , F), w

Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

Automata and Compiler (1) [25 marks] Let N be the last two digits of your student number. Design a finite automaton that accepts the language of strings that end with the last f

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}