Question

Does $L=\{(\langle M \rangle,k)| M$ is a TM and $\exists w\in \sum^*$ s.t when $M$ runs on $w$, $M$ visits some state at least $k$ times$\} \in R$?

score 116 · Answer 1 · 2012-08-05 12:55:24

116

Views

Does $L=\{(\langle M \rangle,k)| M$ is a TM and $\exists w\in \sum^*$ s.t when $M$ runs on $w$, $M$ visits some state at least $k$ times$\} \in R$?

Published on 05 Aug 2012 - 12:55

score 944 · Answer 2 · 2026-02-23 10:14:10

944

Views

Proving Turing Completeness by Simulating Rule 110

Published on 23 Feb 2026 - 10:14

score 670 · Answer 3 · 2012-08-11 12:47:34

670

Views

A question about the regular languages being closed under Boolean operation (how to generalize)

Published on 11 Aug 2012 - 12:47

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

117

Views

Regular expression arithmetics

Published on 28 Mar 2026 - 0:36

score 3.2k · Answer 5 · 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 105 · Answer 6 · 2012-08-21 07:29:09

105

Views

Is $f$ is computable by a finite automaton, the dual of $f$ is thus computable also?

Published on 21 Aug 2012 - 7:29

score 498 · Answer 7 · 2026-04-02 03:16:03

498

Views

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

Published on 02 Apr 2026 - 3:16

score 491 · Answer 8 · 2012-09-01 18:01:06

491

Views

Examples of epsilon transitions

Published on 01 Sep 2012 - 18:01

score 238 · Answer 9 · 2026-04-02 03:15:06

238

Views

Existence of NFA for this language

Published on 02 Apr 2026 - 3:15

score 40 · Answer 10 · 2012-09-06 02:57:33

40

Views

Confusion related to a property of languages on some alphabet V

Published on 06 Sep 2012 - 2:57

score 59 · Answer 11 · 2012-09-06 14:10:52

59

Views

Derivation of a property of a language

Published on 06 Sep 2012 - 14:10

score 1.8k · Answer 12 · 2026-04-02 03:21:10

1.8k

Views

Deciding equivalence of regular languages

Published on 02 Apr 2026 - 3:21

score 57 · Answer 13 · 2012-09-12 21:50:20

57

Views

Given two NFAs, is there a way to figure out if there exists a language that works for both of them?

Published on 12 Sep 2012 - 21:50

score 345 · Answer 14 · 2012-09-26 14:01:06

345

Views

Confusion related to state equivalence of finite state machines

Published on 26 Sep 2012 - 14:01

score 774 · Answer 15 · 2012-10-02 02:06:12

774

Views

finite state machine is strongly connected

Published on 02 Oct 2012 - 2:06

List Question

Does $L=\{(\langle M \rangle,k)| M$ is a TM and $\exists w\in \sum^*$ s.t when $M$ runs on $w$, $M$ visits some state at least $k$ times$\} \in R$?

Proving Turing Completeness by Simulating Rule 110

A question about the regular languages being closed under Boolean operation (how to generalize)

Regular expression arithmetics

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

Is $f$ is computable by a finite automaton, the dual of $f$ is thus computable also?

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

Examples of epsilon transitions

Existence of NFA for this language

Confusion related to a property of languages on some alphabet V

Derivation of a property of a language

Deciding equivalence of regular languages

Given two NFAs, is there a way to figure out if there exists a language that works for both of them?

Confusion related to state equivalence of finite state machines

finite state machine is strongly connected

Trending Questions

Popular # Hahtags

Popular Questions