Question

Verify language that i found of this automata

score 61 · Answer 1 · 2026-04-17 11:20:50

61

Views

Verify language that i found of this automata

Published on 17 Apr 2026 - 11:20

score 133 · Answer 2 · 2026-04-12 13:49:20

133

Views

How can you construct an NFA with k+2 states, where k is an arbitrary natural?

Published on 12 Apr 2026 - 13:49

score 36 · Answer 3 · 2026-04-16 09:04:01

36

Views

Help me check my Automata from given Grammar

Published on 16 Apr 2026 - 9:04

score 280 · Answer 4 · 2026-04-09 17:09:13

280

Views

What is the difference between $\{0,1\}$ and $\{0,1\}^*$?

Published on 09 Apr 2026 - 17:09

score 81 · Answer 5 · 2026-04-12 04:29:51

81

Views

a hard mapping reduction problem

Published on 12 Apr 2026 - 4:29

score 49 · Answer 6 · 2026-05-10 14:59:38

49

Views

How to prove that a language which clones is regular?

Published on 10 May 2026 - 14:59

score 107 · Answer 7 · 2026-05-10 12:50:55

107

Views

Context-Free Grammar to Pushdown (Stack) Automata

Published on 10 May 2026 - 12:50

score 227 · Answer 8 · 2026-05-10 12:53:45

227

Views

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

Published on 10 May 2026 - 12:53

score 242 · Answer 9 · 2026-05-10 12:54:06

242

Views

Subset of Context Free Language with Strings Starting and Ending in Same Symbol is Context Free

Published on 10 May 2026 - 12:54

score 82 · Answer 10 · 2026-05-10 12:54:03

82

Views

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

Published on 10 May 2026 - 12:54

score 1.2k · Answer 11 · 2026-05-10 12:54:15

1.2k

Views

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Published on 10 May 2026 - 12:54

score 67 · Answer 12 · 2026-04-09 11:42:40

67

Views

Equicontinuity or mean equicontinuity?

Published on 09 Apr 2026 - 11:42

score 210 · Answer 13 · 2026-05-10 14:05:34

210

Views

Can we decide if a dragon comes home?

Published on 10 May 2026 - 14:05

score 465 · Answer 14 · 2026-05-10 12:50:15

465

Views

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Published on 10 May 2026 - 12:50

score 122 · Answer 15 · 2026-05-10 12:53:02

122

Views

Deterministic finite automaton (DFA) for regular expression $(a|(bc)^n)^m$

Published on 10 May 2026 - 12:53

List Question

Verify language that i found of this automata

How can you construct an NFA with k+2 states, where k is an arbitrary natural?

Help me check my Automata from given Grammar

What is the difference between $\{0,1\}$ and $\{0,1\}^*$?

a hard mapping reduction problem

How to prove that a language which clones is regular?

Context-Free Grammar to Pushdown (Stack) Automata

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

Subset of Context Free Language with Strings Starting and Ending in Same Symbol is Context Free

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Equicontinuity or mean equicontinuity?

Can we decide if a dragon comes home?

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Deterministic finite automaton (DFA) for regular expression $(a|(bc)^n)^m$

Trending Questions

Popular # Hahtags

Popular Questions