List questions from automata

Published on 30 Apr 2018 - 16:42

130

Views

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

Published on 02 May 2018 - 14:32

32

Views

Help me check my Automata from given Grammar

Published on 02 May 2018 - 15:57

276

Views

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

Published on 13 May 2018 - 1:03

76

Views

a hard mapping reduction problem

Published on 25 May 2018 - 15:57

45

Views

How to prove that a language which clones is regular?

Published on 03 Jun 2018 - 22:46

104

Views

Context-Free Grammar to Pushdown (Stack) Automata

Published on 24 Mar 2026 - 23:41

224

Views

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

Published on 24 Mar 2026 - 23:45

239

Views

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

Published on 24 Mar 2026 - 23:46

80

Views

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

Published on 24 Mar 2026 - 23:46

1.2k

Views

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

Published on 27 Jun 2018 - 12:20

65

Views

Equicontinuity or mean equicontinuity?

Published on 23 Feb 2026 - 2:54

206

Views

Can we decide if a dragon comes home?

Published on 25 Mar 2026 - 1:24

462

Views

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

Published on 25 Mar 2026 - 2:56

118

Views

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

Published on 24 Jul 2018 - 12:42

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