## Regular-language New Question

• ### Prove regular language and automata

This is a grammar and I wan to check if this language is regular or not. L → ε | aLcLc | LL For example the result of this grammar is:acc, accacc ..., aacccc, acaccc, accacc, aaacccccc, ...I ......

• ### Minimum pumping length of a regular language

Consider the languageL = { a3n + 5 | n ≥ 0 } What is the minimum pumping length of L ?...

• ### Convert DFA to RE

I constructed a finite automata for the language L of all strings made of the symbols 0, 1 and 2 (Σ = {0, 1, 2}) where the last symbol is not smaller than the first symbol. E.g., the strings 0, 2012, ......

• ### Annihilator set in regular expression

Given that ø+anything is an indentity, therefore ø + a = a.What exactly is the result of (ø+ øbb)?...

• ### how to prove an arbitrary language can be accepted

we know that language accepted by a DFA can also be accepted by an ISA for DFA is a special case of ISA, so about an arbitrary language? How to prove it?...

• ### Why do we use pumping lemma to prove the non-regul

I have an assignment that I am currently working on and I need to know why do we use pumping lemma? the main question asked is why?I know we can prove the non-regularity and I know the formula/proof ......

• ### Regular or context-free or other

I have a problem that needs to find out the following language is regular or context-free or other.{a^(2i+3j) | i>0, j>0}I have some doubts to say it is a regular or context-free language ......

• ### L={a^i b^j c^k d^l | i=k and j=l} i couldn't f

I have tried S-A|BA-aCcD|aAc|acB-bBd|bdC-bD-dthis to only to output ac and bd's but I can't put b's between a and c's....

• ### Use the pumping lemma to show that the following l

Use the pumping lemma to show that the following languages are not regular languages L = {an bm | n = 2m}...

• ### automate and formal laguages - prove that language

I have 2 questions that I was required to tell if the language is regular or not.I have the answer so I know that the answer for both of them is true.But I don't have the intuation why and I can't ......

• ### Show is not regular with pumping lemma

I need help on this pumping lemma case:L_1 :={a^n b^m c^k | n = m or k = 0}Can someone explain how to handle k=0?I started with abc^n, but I don't know how to split this in uvw....

• ### Is this a valid regular language expression for a

The regular expression is:(10) U ((10(0 U 1))*10) The language I am trying to write is this:(q2 is the accept state and {0,1} is the langauge)(q0,0)=q3(q0,1)=q1(q1,0)=q2 — accept state(q1,1)=......

• ### automate and formal laguages - prove that language

I have 2 questions that I was required to tell if the language is regular or not.I have the answer so I know that the answer for both of them is true.But I don't have the intuation why and I can't ......

• ### Why do we use pumping lemma to prove the non-regul

I have an assignment that I am currently working on and I need to know why do we use pumping lemma? the main question asked is why?I know we can prove the non-regularity and I know the formula/proof ......

• ### What is the regular languages that are equivalent

I am learning automata theory. I have answered the question wrongly three times, and I don't know the right answers. Please help me.The target language is (0+1)*1(0+1)*. The choices are:A) (01+11)*(......