List questions from regular-language

Published on 28 Mar 2026 - 12:12

169

Views

DFA conversion through state elimination and arden's method

Published on 28 Mar 2026 - 12:13

560

Views

$a^nb^n$ language vs $a^nb^m$

Published on 28 Mar 2026 - 12:13

307

Views

FSM and regular language

Published on 31 Mar 2026 - 17:50

2k

Views

a^m b^n c^n prove it's not regular/pumping lemma

Published on 25 Mar 2026 - 20:09

37

Views

constructing grammar for 101(1+0)*

Published on 26 Mar 2026 - 3:18

66

Views

Constructing grammar for $a^ib^j$ / $i\neq j$

Published on 28 Mar 2026 - 13:59

173

Views

proof that L is regular

Published on 11 Mar 2022 - 7:18

38

Views

Solution Verification: Regular expression that starts with $a$ and doesn't contain $aba$ pattern.

Published on 28 Mar 2026 - 13:59

102

Views

Proof of Pumping Lemma: Why can we set the pumping constant to the number of states?

Published on 23 Feb 2026 - 8:28

117

Views

Solution Verification: Prove this using closure properties of regular languages.

Published on 18 Mar 2022 - 23:41

833

Views

Prove that the shift operation on regular languages preserves regularity

Published on 21 Mar 2022 - 23:42

58

Views

Solution verification: Proving that this language is irregular using the pumping lemma.

Published on 25 Mar 2026 - 21:46

31

Views

Is the language represented by the set of binomials following some rule regular?

Published on 24 Mar 2022 - 22:42

216

Views

Pumping lemma on a regular language with different variables

Published on 25 Mar 2026 - 21:46

List Question

intersection of two regular expressions

DFA conversion through state elimination and arden's method

$a^nb^n$ language vs $a^nb^m$

FSM and regular language

a^m b^n c^n prove it's not regular/pumping lemma

constructing grammar for 101(1+0)*

Constructing grammar for $a^ib^j$ / $i\neq j$

proof that L is regular

Solution Verification: Regular expression that starts with $a$ and doesn't contain $aba$ pattern.

Proof of Pumping Lemma: Why can we set the pumping constant to the number of states?

Solution Verification: Prove this using closure properties of regular languages.

Prove that the shift operation on regular languages preserves regularity

Solution verification: Proving that this language is irregular using the pumping lemma.

Is the language represented by the set of binomials following some rule regular?

Pumping lemma on a regular language with different variables

Trending Questions

Popular # Hahtags

Popular Questions