Question

$\{\langle M,q,x\rangle$| $M$ is a Turing machine and $q$ is a state of M and running of $M$ on $w$ visits $q\} \notin R$?

score 333 · Answer 1 · 2012-08-01 09:10:13

333

Views

$\{\langle M,q,x\rangle$| $M$ is a Turing machine and $q$ is a state of M and running of $M$ on $w$ visits $q\} \notin R$?

Published on 01 Aug 2012 - 9:10

score 2.9k · Answer 2 · 2012-08-06 23:41:21

2.9k

Views

Using the pumping lemma to show that a language is not regular (Computer Science)

Published on 06 Aug 2012 - 23:41

score 9.1k · Answer 3 · 2012-08-11 03:50:06

9.1k

Views

Why isn't this a regular language?

Published on 11 Aug 2012 - 3:50

score 117 · Answer 4 · 2026-03-28 00:36:46

117

Views

Regular expression arithmetics

Published on 28 Mar 2026 - 0:36

score 320 · Answer 5 · 2012-08-12 17:48:35

320

Views

How to draw this finite state automaton?

Published on 12 Aug 2012 - 17:48

score 3.2k · Answer 6 · 2026-03-28 00:28:51

3.2k

Views

A regular expression for the words that don't contain the sequence $ab$ over $\{a,b,c\}$

Published on 28 Mar 2026 - 0:28

score 497 · Answer 7 · 2012-08-22 10:24:51

497

Views

Showing $L=\{uw \mid \exists v:uv\in L_{1},vw\in L_{2}\}$ is regular

Published on 22 Aug 2012 - 10:24

score 237 · Answer 8 · 2012-09-03 19:44:51

237

Views

Existence of NFA for this language

Published on 03 Sep 2012 - 19:44

score 1.8k · Answer 9 · 2012-09-11 12:31:49

1.8k

Views

Deciding equivalence of regular languages

Published on 11 Sep 2012 - 12:31

score 169 · Answer 10 · 2012-09-12 21:21:08

169

Views

Does A* = A when A contains an even number of 0s?

Published on 12 Sep 2012 - 21:21

score 888 · Answer 11 · 2012-09-21 03:08:20

888

Views

Confusion related to the concatenation of two grammars

Published on 21 Sep 2012 - 3:08

score 70 · Answer 12 · 2026-03-29 05:49:37

70

Views

Confusion related to context free grammar

Published on 29 Mar 2026 - 5:49

score 179 · Answer 13 · 2026-03-25 23:36:42

179

Views

Confusion related to the type 3 grammar

Published on 25 Mar 2026 - 23:36

score 174 · Answer 14 · 2012-09-29 02:06:38

174

Views

Why is my pumping lemma proof misleading?

Published on 29 Sep 2012 - 2:06

score 114 · Answer 15 · 2012-09-29 04:39:32

114

Views

Is $L = \{\omega : \omega\text{ contains exactly one 'foobar'}\}$ regular?

Published on 29 Sep 2012 - 4:39

List Question

$\{\langle M,q,x\rangle$| $M$ is a Turing machine and $q$ is a state of M and running of $M$ on $w$ visits $q\} \notin R$?

Using the pumping lemma to show that a language is not regular (Computer Science)

Why isn't this a regular language?

Regular expression arithmetics

How to draw this finite state automaton?

A regular expression for the words that don't contain the sequence $ab$ over $\{a,b,c\}$

Showing $L=\{uw \mid \exists v:uv\in L_{1},vw\in L_{2}\}$ is regular

Existence of NFA for this language

Deciding equivalence of regular languages

Does A* = A when A contains an even number of 0s?

Confusion related to the concatenation of two grammars

Confusion related to context free grammar

Confusion related to the type 3 grammar

Why is my pumping lemma proof misleading?

Is $L = \{\omega : \omega\text{ contains exactly one 'foobar'}\}$ regular?

Trending Questions

Popular # Hahtags

Popular Questions