Question

Existence of NFA of a reverse of a language

score 9.2k · Answer 1 · 2012-10-02 10:48:04

9.2k

Views

Existence of NFA of a reverse of a language

Published on 02 Oct 2012 - 10:48

score 4.9k · Answer 2 · 2026-03-29 05:49:40

4.9k

Views

Pushdown automata for the language $\{ w001w^\text{R} : w = \{0,1\}^* \}$

Published on 29 Mar 2026 - 5:49

score 477 · Answer 3 · 2026-04-02 16:30:34

477

Views

Finding if two machines can be equivalent

Published on 02 Apr 2026 - 16:30

score 295 · Answer 4 · 2012-10-05 23:56:30

295

Views

Pushdown automata - definition and definition of $\vdash$

Published on 05 Oct 2012 - 23:56

score 123 · Answer 5 · 2012-10-06 00:38:41

123

Views

Definition of a deterministic Pushdown automaton

Published on 06 Oct 2012 - 0:38

score 909 · Answer 6 · 2012-10-06 02:03:13

909

Views

Proof related to a finite state machine

Published on 06 Oct 2012 - 2:03

score 738 · Answer 7 · 2026-03-29 07:32:13

738

Views

Proving that for every context-free language there exist a pushdown automata $M$ s.t. $L=L_{e}(M)$

Published on 29 Mar 2026 - 7:32

score 66 · Answer 8 · 2012-10-07 21:41:06

66

Views

Legal actions on a PDA and terminology

Published on 07 Oct 2012 - 21:41

score 156 · Answer 9 · 2026-03-29 04:11:10

156

Views

Proving $\{ll^{R}l|l\in\{a,b\}^{*}\}$ is not context free using the pumping lemma

Published on 29 Mar 2026 - 4:11

score 160 · Answer 10 · 2012-10-09 00:54:07

160

Views

Is the language $\{i|f(i)=1\}$ recursive, function $f$ is described further inside.

Published on 09 Oct 2012 - 0:54

score 175 · Answer 11 · 2012-10-17 12:56:42

175

Views

Proving what are the equivalence classes of the relation $R_{L}$

Published on 17 Oct 2012 - 12:56

score 398 · Answer 12 · 2026-03-28 02:10:34

398

Views

What is the difference between the automatas for the regular expressions (a + b)* and (a* + b*)?

Published on 28 Mar 2026 - 2:10

score 4.4k · Answer 13 · 2026-03-28 02:10:38

4.4k

Views

For the regular expression, (a* + b) . (a.b) , does the following automaton recognise the language it describes?

Published on 28 Mar 2026 - 2:10

score 1.1k · Answer 14 · 2012-10-24 07:46:26

1.1k

Views

Creating a minimal dfa from a regular expression

Published on 24 Oct 2012 - 7:46

score 9.2k · Answer 15 · 2012-10-25 17:57:34

9.2k

Views

Can _any_ NFA be converted to a DFA?

Published on 25 Oct 2012 - 17:57

List Question

Existence of NFA of a reverse of a language

Pushdown automata for the language $\{ w001w^\text{R} : w = \{0,1\}^* \}$

Finding if two machines can be equivalent

Pushdown automata - definition and definition of $\vdash$

Definition of a deterministic Pushdown automaton

Proof related to a finite state machine

Proving that for every context-free language there exist a pushdown automata $M$ s.t. $L=L_{e}(M)$

Legal actions on a PDA and terminology

Proving $\{ll^{R}l|l\in\{a,b\}^{*}\}$ is not context free using the pumping lemma

Is the language $\{i|f(i)=1\}$ recursive, function $f$ is described further inside.

Proving what are the equivalence classes of the relation $R_{L}$

What is the difference between the automatas for the regular expressions (a + b)* and (a* + b*)?

For the regular expression, (a* + b) . (a.b) , does the following automaton recognise the language it describes?

Creating a minimal dfa from a regular expression

Can _any_ NFA be converted to a DFA?

Trending Questions

Popular # Hahtags

Popular Questions