Question

creating regular expressions from given language

score 62 · Answer 1 · 2026-03-28 13:59:23

62

Views

creating regular expressions from given language

Published on 28 Mar 2026 - 13:59

score 773 · Answer 2 · 2026-03-25 21:48:57

773

Views

Prove that $L=\{a^n b^l : n \leq l\}$ is not regular by pumping lemma

Published on 25 Mar 2026 - 21:48

score 333 · Answer 3 · 2022-04-19 10:17:46

$L_1$ and $L_2$ are regular and we have a new language $\text{pref}(L_1,L_2) = \{x \in \Sigma^* \mid \exists u \in L_2\text{ s.t. }xu\in L_1\}$

score 336 · Answer 4 · 2026-03-25 21:45:50

336

Views

Proving a language is not regular using the pumping lemma

Published on 25 Mar 2026 - 21:45

score 92 · Answer 5 · 2022-04-21 14:07:59

92

Views

Creation of nondeterministic finite-state machine for a word which doesn't contain a certain symbol

Published on 21 Apr 2022 - 14:07

score 33 · Answer 6 · 2022-04-21 16:33:36

33

Views

Find NFA for the language $L_1$ of all # that can be replaced by string of size 3 that would be in language $L$

Published on 21 Apr 2022 - 16:33

score 259 · Answer 7 · 2026-03-25 21:54:05

259

Views

Prove non regularity of the language a^n where n is an even or a prime number, with the pumping lemma

Published on 25 Mar 2026 - 21:54

score 111 · Answer 8 · 2026-03-28 14:05:41

111

Views

Finding equivalence class for $R_L$ of a regular language

Published on 28 Mar 2026 - 14:05

score 64 · Answer 9 · 2022-04-25 21:05:26

64

Views

Finding an infinite language with finite equivalence classes

Published on 25 Apr 2022 - 21:05

score 119 · Answer 10 · 2022-04-25 22:08:56

119

Views

Prerequisite on $L$ so $L^*$ is finite

Published on 25 Apr 2022 - 22:08

score 50 · Answer 11 · 2022-04-26 23:00:29

50

Views

Prove language irregularity using Nerode theorem

Published on 26 Apr 2022 - 23:00

score 138 · Answer 12 · 2022-04-27 16:40:54

138

Views

Proving that these two regular languages are equal

Published on 27 Apr 2022 - 16:40

score 203 · Answer 13 · 2026-03-29 22:13:26

203

Views

On the general relationship between automata, expressions, and grammars

Published on 29 Mar 2026 - 22:13

score 480 · Answer 14 · 2026-03-29 22:07:38

480

Views

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

Published on 29 Mar 2026 - 22:07

score 123 · Answer 15 · 2022-06-10 12:19:03

123

Views

Is the set of binary words with at least 2 ones regular?

Published on 10 Jun 2022 - 12:19

List Question

creating regular expressions from given language

Prove that $L=\{a^n b^l : n \leq l\}$ is not regular by pumping lemma

$L_1$ and $L_2$ are regular and we have a new language $\text{pref}(L_1,L_2) = \{x \in \Sigma^* \mid \exists u \in L_2\text{ s.t. }xu\in L_1\}$

Proving a language is not regular using the pumping lemma

Creation of nondeterministic finite-state machine for a word which doesn't contain a certain symbol

Find NFA for the language $L_1$ of all # that can be replaced by string of size 3 that would be in language $L$

Prove non regularity of the language a^n where n is an even or a prime number, with the pumping lemma

Finding equivalence class for $R_L$ of a regular language

Finding an infinite language with finite equivalence classes

Prerequisite on $L$ so $L^*$ is finite

Prove language irregularity using Nerode theorem

Proving that these two regular languages are equal

On the general relationship between automata, expressions, and grammars

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

Is the set of binary words with at least 2 ones regular?

Trending Questions

Popular # Hahtags

Popular Questions