Question

Checking if $L_1 \cup L_2$ is regular language

score 108 · Answer 1 · 2015-11-29 15:51:59

108

Views

Checking if $L_1 \cup L_2$ is regular language

Published on 29 Nov 2015 - 15:51

score 189 · Answer 2 · 2015-11-29 18:17:57

189

Views

Wrong prove for $L=\{a^m:m\geq 0,\; m \mod 3\neq 0\}$ isn't regular, but why?

Published on 29 Nov 2015 - 18:17

score 58 · Answer 3 · 2026-03-29 04:22:44

58

Views

NFA Containing 'a'

Published on 29 Mar 2026 - 4:22

score 435 · Answer 4 · 2026-03-27 10:16:06

435

Views

Pumping lemma for context free. How do I define the string 'w' and define cases?

Published on 27 Mar 2026 - 10:16

score 262 · Answer 5 · 2015-12-01 15:58:56

262

Views

Panalphebetic strings provable by DFA?

Published on 01 Dec 2015 - 15:58

score 950 · Answer 6 · 2015-12-01 18:29:33

950

Views

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

Published on 01 Dec 2015 - 18:29

score 148 · Answer 7 · 2015-12-02 01:29:02

148

Views

Deterministic FSM accepting a binary string whose number of zero is either multiple of 2, 3, or both

Published on 02 Dec 2015 - 1:29

score 352 · Answer 8 · 2026-03-28 20:58:49

352

Views

Minimization of DFA

Published on 28 Mar 2026 - 20:58

score 57 · Answer 9 · 2026-03-26 04:34:16

57

Views

Language of all the binary words that contain $010$ at least twise

Published on 26 Mar 2026 - 4:34

score 14.3k · Answer 10 · 2026-03-26 04:32:46

14.3k

Views

Design a DFA to check whether the Given Number is Even

Published on 26 Mar 2026 - 4:32

score 53 · Answer 11 · 2026-03-26 04:38:02

53

Views

Language of all the binary words that not contains continuum of more then $3$ zeros

Published on 26 Mar 2026 - 4:38

score 87 · Answer 12 · 2026-03-26 04:33:06

87

Views

Writing a regular expertion for the language $L=\{0^n1^m \mid n\equiv m\pmod 2\}$

Published on 26 Mar 2026 - 4:33

score 1.5k · Answer 13 · 2026-03-26 04:32:51

1.5k

Views

Build a DFA that accepts strings over $\{0,1,2\}$ that are divided by $3$ and doesn't include the substring $012$.

Published on 26 Mar 2026 - 4:32

score 872 · Answer 14 · 2015-12-03 12:17:04

872

Views

Checking if Post Correspondence Problem has a Solution

Published on 03 Dec 2015 - 12:17

score 1.8k · Answer 15 · 2026-03-27 21:23:32

1.8k

Views

Read-only Turing machine recognizes only regular languages?

Published on 27 Mar 2026 - 21:23

List Question

Checking if $L_1 \cup L_2$ is regular language

Wrong prove for $L=\{a^m:m\geq 0,\; m \mod 3\neq 0\}$ isn't regular, but why?

NFA Containing 'a'

Pumping lemma for context free. How do I define the string 'w' and define cases?

Panalphebetic strings provable by DFA?

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

Deterministic FSM accepting a binary string whose number of zero is either multiple of 2, 3, or both

Minimization of DFA

Language of all the binary words that contain $010$ at least twise

Design a DFA to check whether the Given Number is Even

Language of all the binary words that not contains continuum of more then $3$ zeros

Writing a regular expertion for the language $L=\{0^n1^m \mid n\equiv m\pmod 2\}$

Build a DFA that accepts strings over $\{0,1,2\}$ that are divided by $3$ and doesn't include the substring $012$.

Checking if Post Correspondence Problem has a Solution

Read-only Turing machine recognizes only regular languages?

Trending Questions

Popular # Hahtags

Popular Questions