List questions from regular-expressions

Published on 25 Mar 2026 - 12:48

71

Views

How can we derive 01* from 0+01*?

Published on 02 Nov 2016 - 13:51

55

Views

Pumping lemma to prove the set of all words such that the sum of the number of 0s and 1s occurring in it is an even number is not regular

Published on 25 Mar 2026 - 7:46

68

Views

How to translate this deterministic finite state automata into a regular expression..

Published on 25 Mar 2026 - 17:36

133

Views

Using pumping lemma to prove a set of substrings cannot be expressed as a regular expression...

Published on 25 Mar 2026 - 7:42

229

Views

L is a regular language. Is $L' = \{a^{|w|} : w \in L\} $ a regular language?

Published on 09 Nov 2016 - 21:39

178

Views

L is a regular language. Is $L′ = \{w \in L: |w| \bmod2=1\}$ a regular language?

Published on 10 Nov 2016 - 15:59

57

Views

Trignometry - Cos

Published on 14 Nov 2016 - 7:39

196

Views

Hysteresis in finite automata

Published on 25 Mar 2026 - 14:27

71

Views

why start operating of empty language equal empty element?

Published on 16 Nov 2016 - 21:44

3.9k

Views

Complement of regular language is regular

Published on 17 Nov 2016 - 12:09

122

Views

What is the difference between the languages?

Published on 29 Nov 2016 - 18:06

477

Views

Let L be a regular language, $L'= \{xz \space | \space \exists y \space \in \sum^* : xyz \in L\}$ Prove that L' is regular

Published on 25 Mar 2026 - 19:06

246

Views

Need help with this regular expression

Published on 13 Dec 2016 - 2:46

144

Views

Finding regular language and DFA for equation $(2)$

Published on 02 Jan 2017 - 14:41

List Question

NFA to GNFA, for the same state do we add an epsilon or a phi?

How can we derive 01* from 0+01*?

Pumping lemma to prove the set of all words such that the sum of the number of 0s and 1s occurring in it is an even number is not regular

How to translate this deterministic finite state automata into a regular expression..

Using pumping lemma to prove a set of substrings cannot be expressed as a regular expression...

L is a regular language. Is $L' = \{a^{|w|} : w \in L\} $ a regular language?

L is a regular language. Is $L′ = \{w \in L: |w| \bmod2=1\}$ a regular language?

Trignometry - Cos

Hysteresis in finite automata

why start operating of empty language equal empty element?

Complement of regular language is regular

What is the difference between the languages?

Let L be a regular language, $L'= \{xz \space | \space \exists y \space \in \sum^* : xyz \in L\}$ Prove that L' is regular

Need help with this regular expression

Finding regular language and DFA for equation $(2)$

Trending Questions

Popular # Hahtags

Popular Questions