Question

Finding regular expressions for which a given Turing machine halts and accepts, halts and rejects, and diverges.

score 391 · Answer 1 · 2026-03-26 20:39:53

391

Views

Finding regular expressions for which a given Turing machine halts and accepts, halts and rejects, and diverges.

Published on 26 Mar 2026 - 20:39

score 1.6k · Answer 2 · 2015-05-07 03:19:12

1.6k

Views

Converting an NFA to DFA

Published on 07 May 2015 - 3:19

score 57 · Answer 3 · 2026-03-27 13:10:37

Let $LOOP_{TM}$ be descriptor language of all touring machines that won't halt for any input. Show reduction of $HALT_{TM}$ to $LOOP_{TM}$

score 192 · Answer 4 · 2026-03-27 13:08:37

192

Views

Designing a Turing Machine - low level transitions

Published on 27 Mar 2026 - 13:08

score 910 · Answer 5 · 2015-05-11 03:42:27

910

Views

How to find the right quotient of a language given two languages?

Published on 11 May 2015 - 3:42

score 3.8k · Answer 6 · 2015-05-17 01:36:56

3.8k

Views

Find the language recognized by the given deterministic finite state automaton

Published on 17 May 2015 - 1:36

score 2.3k · Answer 7 · 2015-05-17 02:20:14

2.3k

Views

Construct a deterministic finite state automaton

Published on 17 May 2015 - 2:20

score 2.4k · Answer 8 · 2026-03-27 02:01:24

2.4k

Views

Context free grammar $\{a^n b^m c^k\; : \;k>m \; \; k>n\}$

Published on 27 Mar 2026 - 2:01

score 763 · Answer 9 · 2015-05-18 20:25:17

763

Views

Proving from Myhill-Nerode that the minimum DFA is the smallest automaton recognizing $L$

Published on 18 May 2015 - 20:25

score 548 · Answer 10 · 2015-05-18 20:44:43

548

Views

Minimum Size of DFA

Published on 18 May 2015 - 20:44

score 109 · Answer 11 · 2026-03-25 14:28:47

109

Views

Context-free language or not

Published on 25 Mar 2026 - 14:28

score 2.8k · Answer 12 · 2015-05-24 21:29:15

2.8k

Views

Is the intersection of a finite language and an infinite language always a regular language?

Published on 24 May 2015 - 21:29

score 9.6k · Answer 13 · 2015-05-25 01:26:08

9.6k

Views

Why are Recursively enumerable languages closed under intersection?

Published on 25 May 2015 - 1:26

score 3k · Answer 14 · 2015-05-25 15:37:25

3k

Views

Concatenation of Finite Languages and Regular Languages

Published on 25 May 2015 - 15:37

score 809 · Answer 15 · 2015-05-26 21:15:51

809

Views

Proving that $L := \{a^n\mid\exists k \geq 0\ n = k^3\}$ is not a regular language

Published on 26 May 2015 - 21:15

List Question

Finding regular expressions for which a given Turing machine halts and accepts, halts and rejects, and diverges.

Converting an NFA to DFA

Let $LOOP_{TM}$ be descriptor language of all touring machines that won't halt for any input. Show reduction of $HALT_{TM}$ to $LOOP_{TM}$

Designing a Turing Machine - low level transitions

How to find the right quotient of a language given two languages?

Find the language recognized by the given deterministic finite state automaton

Construct a deterministic finite state automaton

Context free grammar $\{a^n b^m c^k\; : \;k>m \; \; k>n\}$

Proving from Myhill-Nerode that the minimum DFA is the smallest automaton recognizing $L$

Minimum Size of DFA

Context-free language or not

Is the intersection of a finite language and an infinite language always a regular language?

Why are Recursively enumerable languages closed under intersection?

Concatenation of Finite Languages and Regular Languages

Proving that $L := \{a^n\mid\exists k \geq 0\ n = k^3\}$ is not a regular language

Trending Questions

Popular # Hahtags

Popular Questions