Concatenation, Theory of Computation

We saw earlier that LT is not closed under concatenation. If we think in terms of the LT graphs, recognizing the concatenation of LT languages would seem to require knowing, while scanning a string in L1 . L2, for instance, when to switch from keeping track of factors for L1 to keeping track of factors from L2.

Assuming that the alphabets were not disjoint, there is (evidently, since LT is not closed under concatenation) no way, in general, to know that. For the recognizable languages, on the other hand, we have the convenience of being able to work with non-determinism. We don't actually have to know when to switch from one automaton to the next. Whenever we get to a point in the string that could possibly be the end of the pre?x that is in L1 we can just allow for a non-deterministic choice of whether to continue scanning for A1 (the machine recognizing L1) or to switch to scanning for A2. Since whenever the string is in L1 .  L2 there will be some correct place to switch and since acceptance by a NFA requires only that there some accepting computation, the combined automaton will accept every string in L1 . L2. Moreover, the combined automaton will accept a string iff there is some point at which it can be split into a string accepted by A1 followed by one accepted by A2: it accepts all and only the strings in L1 . L2.

Posted Date: 3/21/2013 3:18:22 AM | Location : United States







Related Discussions:- Concatenation, Assignment Help, Ask Question on Concatenation, Get Answer, Expert's Help, Concatenation Discussions

Write discussion on Concatenation
Your posts are moderated
Related Questions
The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis

LTO was the closure of LT under concatenation and Boolean operations which turned out to be identical to SF, the closure of the ?nite languages under union, concatenation and compl

implementation of operator precedence grammer


write short notes on decidable and solvable problem


The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha

Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.