List questions from regular-language

Published on 29 Apr 2026 - 12:51

45

Views

To show that language is not regular using pumping lemma

Published on 29 Apr 2026 - 5:50

111

Views

PL to prove a language is not regular

Published on 05 May 2026 - 16:25

267

Views

Proving language is not regular using pumping lemma

Published on 05 May 2026 - 8:34

384

Views

Given regular language $L,$ prove $L'$ is regular

Published on 15 Apr 2026 - 10:26

1.8k

Views

How to find Myhill-Nerode equivalence classes, algorithmically?

Published on 25 Mar 2026 - 6:17

2.6k

Views

Regular Expression VS Finite Automata

Published on 10 May 2026 - 11:39

194

Views

is a fractional i allowed in pumping lemma??

Published on 02 May 2026 - 1:09

114

Views

Regular expression operations

Published on 10 May 2026 - 12:50

38

Views

* on empty string

Published on 10 May 2026 - 12:50

2.6k

Views

Design a Deterministic Finite Automata (DFA) for 'abab'

Published on 17 Apr 2026 - 11:52

6.2k

Views

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Published on 16 Apr 2026 - 9:22

50

Views

q can be reached from R by traveling along 0 or more ε arrows

Published on 17 Apr 2026 - 4:36

5.1k

Views

Write a minimal DFA for the language $L = \{(ab)^n \mid n \geq 0\}$

Published on 16 Apr 2026 - 1:45

125

Views

Regular languages: Prove $2^n + n < 2^{n+1}$ for $n \ge 1$

Published on 17 Apr 2026 - 5:31

List Question

A simple example in regular categorical logic

To show that language is not regular using pumping lemma

PL to prove a language is not regular

Proving language is not regular using pumping lemma

Given regular language $L,$ prove $L'$ is regular

How to find Myhill-Nerode equivalence classes, algorithmically?

Regular Expression VS Finite Automata

is a fractional i allowed in pumping lemma??

Regular expression operations

* on empty string

Design a Deterministic Finite Automata (DFA) for 'abab'

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

q can be reached from R by traveling along 0 or more ε arrows

Write a minimal DFA for the language $L = \{(ab)^n \mid n \geq 0\}$

Regular languages: Prove $2^n + n < 2^{n+1}$ for $n \ge 1$

Trending Questions

Popular # Hahtags

Popular Questions