For any two P-language L1 and L2 let M1 and M2 be the TMs that decide them in polynomial time. The set of languages is closed under union intersection concatenation complement Kleene star. Prove that Recursive Languagess are closed under Union 2.įrankly the only one that is interesting is since the others are rather easy. Use these algorithms to determine the membership in the given languages. We just show closure under concatenation and. Because L 2 2P then there exists a TM M 2 with time complexity Onk 2 for some constant k 2.ī The complexity class coP contains all languages L whose complement is in P. Use FSMs for A and B to create a machine that recognizes the union. The class P is closed under union concatenation and complement. Let p 1 p 2 P Then by definition of P p 1 is solvable in O n k for some k N. Show that the class P is closed under union intersection concatenation and complement. The following is my proof for P being closed under union. Suppose that language L 1 2P and language L 2 2P.ĭiana Ross And The Supremes At The Curry Hicks Cage On The Campus Of The University Of Massachusetts Amherst Vintage Concert Posters Diana Ross Concert Posters If A and B are regular languages then so is A ο B. An input is in if either of the two algorithms return 1 when run on the.
0 Comments
Leave a Reply. |