**cs402 midterm solved papers by waqar siddhu**

**Introduction to Computer Theory Chapter 4**

Summary RE, Repeated definition of RE, which describes languages **cs402 midterm solved papers by waqar siddhu**

Note: produce L2. Repeated definition of standard expression (RE).

**Step 1:** The whole Σ letter includes Λ a common expression.

**Step 2**: If r1 and r2 common expressions at the time they are common expressions.

**Step 3:** Nothing else is said regularly. Method 3 (General expressions) Consider the language L = {Λ, x, xx, xxx,…} of the strings, defined above Σ = {x}. We can write this language as Kleene star closing for words Σ or L = Σ * = {x} *. This language can also be defined in general expression x *. **cs402 midterm solved papers by waqar siddhu**

Similarly the language L = {x, xx, xxx,…}, defined above Σ = {x}, can be expressed in normal expression x + Now consider another language L, which contains all possible strings, defined above Σ = {a, b}. This language is correct and expressed in normal expression (a + b) *. Now consider another language L, of single-stranded strings, defined above Σ = {a, b}, and then the standard the expression can be b * ab *. **cs402 midterm solved papers by waqar siddhu**

Now consider another language L, of longer length, defined above Σ = {a, b}, then it is the most common way of expressing ((a + b) (a + b)) *. Now think of another language L, of unequal length, defined above Σ = {a, b}, where the normal expression may be (a + b) ((a + b) (a + b)) * or ((a + b) (a + b)) * (a + b). Announce It can be known that a language can be represented by more than one common expression, while it is given in normal speech is a unique language produced by that common expression. **cs402 midterm solved papers by waqar siddhu**

**For example**

Consider the language, described above Σ = {a, b} of at least one of the words a, which can be expressed in the ordinary expression (a + b) * a (a + b) *. Think of a language, defined above Σ = {a, b} of at least one and no b words, which can be expressed by common expression (a + b) * a (a + b) * b (a + b) * + (a + b) * b (a + b) * a (a + b) *. Think of a language, defined above Σ = {a, b}, of words that begin with a double and end with a double b then normal expression can be aa (a + b) * bb Think of a language, defined above Σ = {a, b} of words beginning with a and ending in b OR it starts with a b and ends with a, then its normal expression can be a (a + b) * b + b (a + b) * a Automata Theory (CS402All limited languages

**For example**

Think of language L, defined above Σ = {a, b}, of 2 strands, starting with a, then L = {aa, ab}, can be expressed in normal expression a a + ab. So L is, by definition, a common language. It can be noted that if a language contains even a thousand words, its RE can be displayed, including ‘+’ in the middle all words. Here the special structure of RE is not necessary. Think of the language L = {aaa, aab, aba, abb, baa, bab, bba, bbb}, which could be shown by RE aaa + aab + aba + abb + baa + bab + bba + bbb, equal (a + b) (a + b) (a + b).

**cs402 midterm solved papers by waqar siddhu**

**Introduction to Finite Automaton**

There are some pieces of paper. Some are white and some are black. Number of

64 pieces of paper or less. Arrangements in which these pieces of paper may be placed under boxes, finished. To start the game, one of the preparations should be the initial setup. There is a dice that can produce numbers 2,3,4,… 12. For each number produced, the unique order is correlation between possible arrangements. Indicates that the total number of editing modification rules is limited. One or more edits can be which should have been a win-win arrangement. It can be seen that winning a game depends on the sequence in which the numbers are made. This game structure can be considered as a limited automaton.

**cs402 midterm solved papers by waqar siddhu**

**Method 4** **(Finite Automaton)**

**Definition**

Finite automaton (FA), the following collection Total number of provinces, with and without (probably not) the last provinces. A complete set of input characters (Σ) in which the input cables are built. Completed set of changes eg per region and per entry page there are changes showing how to move from one state to another.

**For example**

Σ = {a, b} Country: x, y, z where x is the first state and z is the last state.

Changes: In case x reads a, it will in position z Reads x read b, goes to shape y In the realm y you read a, b go say y In government z you read a, b go say z.

### cs402 midterm solved papers by waqar siddhu

**GET ALL CS402 PAPERS FROM HERE**

**vu all midterm past papers solved by moaaz**