Question

DFA worst case states

score 518 · Answer 1 · 2013-04-12 11:38:48

518

Views

DFA worst case states

Published on 12 Apr 2013 - 11:38

score 524 · Answer 2 · 2026-03-28 08:46:20

524

Views

Decidability/Undecidability Question

Published on 28 Mar 2026 - 8:46

score 795 · Answer 3 · 2026-03-28 08:47:12

795

Views

Turing Machine question, this is NOT HW

Published on 28 Mar 2026 - 8:47

score 241 · Answer 4 · 2026-03-27 21:35:44

241

Views

How to construct a context free grammar $G$ such that $L(G) = \{ a^i b^j c^k| j \gt i+k\} $?

Published on 27 Mar 2026 - 21:35

score 181 · Answer 5 · 2026-03-27 21:35:43

181

Views

How to construct a context free grammar $G$ such that $L(G) = \{ a^i b^j a^k| j \gt i+k\} $?

Published on 27 Mar 2026 - 21:35

score 497 · Answer 6 · 2013-05-04 02:37:48

497

Views

An NFA with $\Sigma = \{1\}$ with $x^2$ accepting runs on strings $1^x$ for all $x \geq 0$ - how to construct?

Published on 04 May 2013 - 2:37

score 67 · Answer 7 · 2013-05-05 01:59:19

67

Views

Given a DFA $\mathcal{M} = (S, \Sigma, q_0, \delta, F)$, is there an algorithm that finds the pumping length of $L(\mathcal{M}$)?

Published on 05 May 2013 - 1:59

score 229 · Answer 8 · 2013-05-09 22:17:49

229

Views

Automata: 1=2, 2= 26, 3=1054, 4=5768, 5 =139314069504, 6 = ???

Published on 09 May 2013 - 22:17

score 3.2k · Answer 9 · 2026-03-30 11:17:07

3.2k

Views

Prove $L=\{ 1^n| n\hspace{2mm}\text{is a prime number} \}$ is not regular.

Published on 30 Mar 2026 - 11:17

score 2k · Answer 10 · 2013-05-24 09:50:31

2k

Views

regular expression

Published on 24 May 2013 - 9:50

score 180 · Answer 11 · 2026-03-27 10:07:43

180

Views

Give a regular grammar for L

Published on 27 Mar 2026 - 10:07

score 1.8k · Answer 12 · 2026-03-27 23:13:04

1.8k

Views

Find push down automata and context free grammar

Published on 27 Mar 2026 - 23:13

score 262 · Answer 13 · 2026-03-27 10:16:44

262

Views

Algorithm for a regular expression

Published on 27 Mar 2026 - 10:16

score 3.2k · Answer 14 · 2026-03-27 23:13:08

3.2k

Views

Proof that equal-length-concatenation is a context-free language?

Published on 27 Mar 2026 - 23:13

score 311 · Answer 15 · 2026-03-30 12:56:59

311

Views

Regular composition of non-regular language

Published on 30 Mar 2026 - 12:56

List Question

DFA worst case states

Decidability/Undecidability Question

Turing Machine question, this is NOT HW

How to construct a context free grammar $G$ such that $L(G) = \{ a^i b^j c^k| j \gt i+k\} $?

How to construct a context free grammar $G$ such that $L(G) = \{ a^i b^j a^k| j \gt i+k\} $?

An NFA with $\Sigma = \{1\}$ with $x^2$ accepting runs on strings $1^x$ for all $x \geq 0$ - how to construct?

Given a DFA $\mathcal{M} = (S, \Sigma, q_0, \delta, F)$, is there an algorithm that finds the pumping length of $L(\mathcal{M}$)?

Automata: 1=2, 2= 26, 3=1054, 4=5768, 5 =139314069504, 6 = ???

Prove $L=\{ 1^n| n\hspace{2mm}\text{is a prime number} \}$ is not regular.

regular expression

Give a regular grammar for L

Find push down automata and context free grammar

Algorithm for a regular expression

Proof that equal-length-concatenation is a context-free language?

Regular composition of non-regular language

Trending Questions

Popular # Hahtags

Popular Questions