Question

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

score 1.5k · Answer 1 · 2026-02-23 19:19:54

1.5k

Views

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

Published on 23 Feb 2026 - 19:19

score 267 · Answer 2 · 2017-12-09 22:47:55

267

Views

In a Turing machine, can we determine how many times a loop will be processed?

Published on 09 Dec 2017 - 22:47

score 26 · Answer 3 · 2017-12-11 09:06:15

26

Views

Any suggestions on how to go about proving that C generates infinite number of strings?

Published on 11 Dec 2017 - 9:06

score 133 · Answer 4 · 2017-12-14 19:01:49

133

Views

Turing machine remembering its position

Published on 14 Dec 2017 - 19:01

score 49 · Answer 5 · 2017-12-18 15:22:39

49

Views

Defining an efficient space-time translation to a slow Turing machine

Published on 18 Dec 2017 - 15:22

score 38 · Answer 6 · 2026-03-28 20:05:39

38

Views

define a type $0$ grammar to accept the language

Published on 28 Mar 2026 - 20:05

score 1.1k · Answer 7 · 2017-12-27 07:58:02

1.1k

Views

Is it possible to make a turing machine counter for decimal numbers?

Published on 27 Dec 2017 - 7:58

score 2.9k · Answer 8 · 2018-01-03 15:07:03

2.9k

Views

How to insert symbols into tape?

Published on 03 Jan 2018 - 15:07

score 796 · Answer 9 · 2018-01-05 14:56:56

796

Views

Is there an algorithm to determine if a power series is periodic?

Published on 05 Jan 2018 - 14:56

score 319 · Answer 10 · 2012-10-15 00:27:30

319

Views

Would adding a stack to a 2-stack Turing machine allow it to recognize more languages?

Published on 15 Oct 2012 - 0:27

score 2k · Answer 11 · 2012-10-21 16:50:36

2k

Views

How can Busy beaver($10 \uparrow \uparrow 10$) have no provable upper bound?

Published on 21 Oct 2012 - 16:50

score 3.1k · Answer 12 · 2012-10-28 21:02:10

3.1k

Views

How can a turing machine solve the element distinctness problem?

Published on 28 Oct 2012 - 21:02

score 1.1k · Answer 13 · 2012-10-29 19:13:25

1.1k

Views

Understanding of working of Turing Machine for $\{0^k1^k\}$

Published on 29 Oct 2012 - 19:13

score 5.9k · Answer 14 · 2012-11-06 08:26:30

5.9k

Views

Language that is recursively enumerable, but not recursive

Published on 06 Nov 2012 - 8:26

score 3.2k · Answer 15 · 2012-11-10 15:52:02

3.2k

Views

Baker-Gill-Solovay theorem

Published on 10 Nov 2012 - 15:52

List Question

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

In a Turing machine, can we determine how many times a loop will be processed?

Any suggestions on how to go about proving that C generates infinite number of strings?

Turing machine remembering its position

Defining an efficient space-time translation to a slow Turing machine

define a type $0$ grammar to accept the language

Is it possible to make a turing machine counter for decimal numbers?

How to insert symbols into tape?

Is there an algorithm to determine if a power series is periodic?

Would adding a stack to a 2-stack Turing machine allow it to recognize more languages?

How can Busy beaver($10 \uparrow \uparrow 10$) have no provable upper bound?

How can a turing machine solve the element distinctness problem?

Understanding of working of Turing Machine for $\{0^k1^k\}$

Language that is recursively enumerable, but not recursive

Baker-Gill-Solovay theorem

Trending Questions

Popular # Hahtags

Popular Questions