List Question
20 TechQA 2023-10-17T00:10:55.637000Why pumping lemma for context free languages do not have bound on first part of string?
70 views
Asked by Kapil
Recognize the type of the given formal language
65 views
Asked by Juj_11
concatenation of a context-free language
78 views
Asked by kiwi kiwi
Pumping Lemma and Hierachy
74 views
Asked by SmallBrainStudent
Using string of set length with pumping lemma to prove irregularity
258 views
Asked by Mr Bones
Can someone help me with this proof about the pumping lemma using coq?
176 views
Asked by silver-ymz
Why is L = {a^ib^i , 0<i<5} regular?
385 views
Asked by tonythestark
Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?
996 views
Asked by Laura Aguiar Martinho
Proving if a language is context free with pumping lemma
378 views
Asked by Chaot1c
Is L = {ww^Ru | w, u ∈ {0,1}+} regular language?
1.2k views
Asked by Charles Zhang
Regular language demonstration
64 views
Asked by redsunflower
How to prove a language with (ab)^n.. is not regular with pumping lemma?
859 views
Asked by han chu
How to translate this description into a language?
35 views
Asked by blackdiamondx
How to prove that L = {a^j b^k c^k d^k: j, k ≥ 1} ∪ {b^j c^k d^l : j, k, l ≥ 0} satisfies the pumping lemma for CFL’s?
825 views
Asked by Jon Silver
Operating on a Regular Expression before applying Pumping Lemma
65 views
Asked by Zak Vanstrom
Show is not regular with pumping lemma
269 views
Asked by Saddam abi
Discrete Logarithm in Prolog
381 views
Asked by AudioBubble
Why do we use pumping lemma to prove the non-regularity of languages? WHY?
75 views
Asked by Abdul Ahad Akram
How to read language definition syntax for regular/nonregular languages
34 views
Asked by Kiefer_Michael
Use the pumping lemma to show that the following languages are not regular languages L = {anbm | n = 2m}
596 views
Asked by alaa raed