List questions from regular-language

Published on 25 Mar 2026 - 7:38

856

Views

Pumping lemma, L={WW^R | W can be {1}+}

Published on 22 Mar 2026 - 23:58

239

Views

Why is the singleton language {x} regular?

Published on 13 Feb 2019 - 22:09

2.4k

Views

language kleene star union not equal to union of language kleene star

Published on 25 Mar 2026 - 11:06

51

Views

regular language proof

Published on 25 Mar 2026 - 17:17

79

Views

How can we modify the proof if the alphabet in $M_1$ and the alphabet in $M_2$ are not the same? (Regular Language, Sipser)

Published on 25 Mar 2026 - 17:20

56

Views

Non automatic structure, which is decidable

Published on 03 Mar 2019 - 22:33

81

Views

Pumping lemma L={$a^i$ $b^j$, / 0<j<i<infinity}?

Published on 25 Mar 2026 - 3:01

3.6k

Views

What is the regular expression for all bit strings with even number of 0's?

Published on 25 Mar 2026 - 11:03

50

Views

How to read formal definition of a language.

Published on 25 Mar 2019 - 3:09

1.2k

Views

union of non-regular language and finite language

Published on 25 Mar 2026 - 18:47

199

Views

prove/disprove: If the language $L$ is such that for every $CFL$ $L'$ , the language $L \cap L'$ is $CFL$, then $L$ is regular?

Published on 25 Mar 2026 - 6:13

2.5k

Views

Regular Expression for $L = \{a^n b^m | n \geq 1, m \geq 1, nm \geq 3\}$

Published on 25 Mar 2026 - 11:04

4.4k

Views

Regular expression of $L = \{w \in \{0, 1\}^* \mid w \text{ does not contain $111$}\}$

Published on 25 Mar 2026 - 16:02

83

Views

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Published on 25 Mar 2026 - 6:12

List Question

Regular Grammar

Pumping lemma, L={WW^R | W can be {1}+}

Why is the singleton language {x} regular?

language kleene star union not equal to union of language kleene star

regular language proof

How can we modify the proof if the alphabet in $M_1$ and the alphabet in $M_2$ are not the same? (Regular Language, Sipser)

Non automatic structure, which is decidable

Pumping lemma L={$a^i$ $b^j$, / 0<j<i<infinity}?

What is the regular expression for all bit strings with even number of 0's?

How to read formal definition of a language.

union of non-regular language and finite language

prove/disprove: If the language $L$ is such that for every $CFL$ $L'$ , the language $L \cap L'$ is $CFL$, then $L$ is regular?

Regular Expression for $L = \{a^n b^m | n \geq 1, m \geq 1, nm \geq 3\}$

Regular expression of $L = \{w \in \{0, 1\}^* \mid w \text{ does not contain $111$}\}$

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Trending Questions

Popular # Hahtags

Popular Questions