- How do you determine if a language is regular?
- How do you know if a language is context free or regular?
- Which of the following is a regular language?
- How do you prove that a language is not regular?
- Does a regular language have to be infinite?
- Which of the following is not regular?
- Which of the following languages are regular L1?
- Why Every finite language is regular?
- What does it mean for a regular language to be closed?
- Which one of the following is a regular language?

Every finite set represents a regular language. Example 1 – All strings of length = 2 over {a, b}* i.e. L = {aa, ab, ba, bb} is regular. Given an expression of non-regular language, but the value of parameter is bounded by some constant, then the language is regular (means it has kind of finite comparison).

A grammar is context-free if left-hand sides of all productions contain exactly one non-terminal symbol. By definition, if one exists, then the language is context-free.

Discussion ForumQue.Which of the following is a regular language?b.String with substring wwr in betweenc.Palindrome stringd.String with even number of Zero'sAnswer:String with even number of Zero's

Method to prove that a language L is not regularSelect w such that |w| ≥ c.Select y such that |y| ≥ 1.Select x such that |xy| ≤ c.Assign the remaining string to z.Select k such that the resulting string is not in L.

Regular languages all have finite descriptions. But the set of strings in the language can be infinite. For example the language A* consists of all strings containing zero or more A symbols, and nothing else, and is certainly infinite.

Which of the following are not regular ?1)Set of all palindromes made up of 0's and 1's2)String of 0's whose length is a perfect square3)All of these4)Strings of 0's, whose length is a prime number5)NULL

Discussion ForumQue.Which of the following languages is/are regular? L1: {wxwR ⎪ w, x ∈ {a, b}* and ⎪w⎪, ⎪x⎪ >0} wR is the reverse of string w L2: {anbm ⎪m ≠ n and m, n≥0 L3: {apbqcr ⎪ p, q, r ≥ 0}b.L2c.L2 and L3 onlyd.L3 onlyAnswer:L1 and L3 only

The following theorem shows that any finite language is regular. We say a language is finite if it consists of a finite number of strings, that is, a finite language is a set of n strings for some natural number n. We then prove that a language consisting of a single string is regular.

Closure properties on regular languages are defined as certain operations on regular language which are guaranteed to produce regular language. Closure refers to some operation on a language, resulting in a new language that is of same “type” as originally operated on i.e., regular.

Discussion ForumQue.Which of the following is a regular language?b.String with substring wwr in betweenc.Palindrome stringd.String with even number of Zero'sAnswer:String with even number of Zero's

Is 1.5 only a rational number?

Is 1.3 a rational or irrational number?

Is the inverse of sine the same as 1 sin?

Is 1.4 A irrational number?

How long does banana pudding last? Banana pudding lasts at least three days in the refrigerator. It would help if you covered the dessert so that it doesn't lose its flavor. On the third day, it might have a different color, but it's still safe to serve it.

Results may vary based on the type of lunch bag, the amount of food inside, the ice pack being used, and the temperature outside. Your lunch bag or box will stay cold for about two hours, but you don't want to push it.