Question

Constructing a NFA from a right linear grammar, is this correct?

score 4.1k · Answer 1 · 2014-10-15 03:22:41

4.1k

Views

Constructing a NFA from a right linear grammar, is this correct?

Published on 15 Oct 2014 - 3:22

score 381 · Answer 2 · 2026-03-25 14:28:54

381

Views

Push Down Automata that recognizes language

Published on 25 Mar 2026 - 14:28

score 39 · Answer 3 · 2014-10-15 12:37:36

39

Views

abstract machine, what language does M accecpt?

Published on 15 Oct 2014 - 12:37

score 86 · Answer 4 · 2014-10-18 22:08:36

86

Views

Building PDA for a Language

Published on 18 Oct 2014 - 22:08

score 110 · Answer 5 · 2014-10-19 23:44:04

110

Views

Construct finite Automata

Published on 19 Oct 2014 - 23:44

score 5.1k · Answer 6 · 2014-10-21 21:17:48

Converting the NFA produced from the language $a^nb^n : n\geq 0$ to a DFA to show its regular? Leading to question about pumping lemma.

score 214 · Answer 7 · 2014-10-22 09:41:05

214

Views

How to prove that $ \{ 0^n 1^{5n} : n \ge 10000 \} $ is not a regular language?

Published on 22 Oct 2014 - 9:41

score 229 · Answer 8 · 2014-10-23 04:00:20

229

Views

Is this correct way to prove that { $uv$ $\mid$ $u$ and $v$ are strings over $(0,1)$ & $|u| = |v|$ } language is not regular?

Published on 23 Oct 2014 - 4:00

score 4k · Answer 9 · 2026-03-25 14:32:26

4k

Views

CFG and PDA for w1#w2

Published on 25 Mar 2026 - 14:32

score 364 · Answer 10 · 2014-10-25 23:07:26

364

Views

Pumping lemma to prove that a language is not context free

Published on 25 Oct 2014 - 23:07

score 421 · Answer 11 · 2014-10-26 17:22:00

421

Views

Deterministic finite automaton algorithm

Published on 26 Oct 2014 - 17:22

score 1.1k · Answer 12 · 2014-10-27 05:57:11

1.1k

Views

Show a Turing Machine accepts all DFAs

Published on 27 Oct 2014 - 5:57

score 133 · Answer 13 · 2014-10-28 18:20:42

133

Views

Pushdown automaton design

Published on 28 Oct 2014 - 18:20

score 84 · Answer 14 · 2014-10-28 20:26:26

84

Views

Nondeterministic finite automaton understanding problem

Published on 28 Oct 2014 - 20:26

score 690 · Answer 15 · 2026-03-25 16:08:38

690

Views

Is it possible to build an Pushdown Automata for an Ambiguous Context-Free Grammar?

Published on 25 Mar 2026 - 16:08

List Question

Constructing a NFA from a right linear grammar, is this correct?

Push Down Automata that recognizes language

abstract machine, what language does M accecpt?

Building PDA for a Language

Construct finite Automata

Converting the NFA produced from the language $a^nb^n : n\geq 0$ to a DFA to show its regular? Leading to question about pumping lemma.

How to prove that $ \{ 0^n 1^{5n} : n \ge 10000 \} $ is not a regular language?

Is this correct way to prove that { $uv$ $\mid$ $u$ and $v$ are strings over $(0,1)$ & $|u| = |v|$ } language is not regular?

CFG and PDA for w1#w2

Pumping lemma to prove that a language is not context free

Deterministic finite automaton algorithm

Show a Turing Machine accepts all DFAs

Pushdown automaton design

Nondeterministic finite automaton understanding problem

Is it possible to build an Pushdown Automata for an Ambiguous Context-Free Grammar?

Trending Questions

Popular # Hahtags

Popular Questions