Question

State Change in a Turing Machine(Computer of Integer Function)

score 1.2k · Answer 1 · 2026-03-27 17:50:25

1.2k

Views

State Change in a Turing Machine(Computer of Integer Function)

Published on 27 Mar 2026 - 17:50

score 36 · Answer 2 · 2015-11-30 16:13:49

36

Views

Is this property of infinite language correct?

Published on 30 Nov 2015 - 16:13

score 61 · Answer 3 · 2015-11-30 17:25:15

61

Views

Two claims about $L=\{a^n: n>o, \ n\text{ does not contain the digit } 7\}.$ that I didn't succeed to prove

Published on 30 Nov 2015 - 17:25

score 951 · Answer 4 · 2026-03-29 21:01:52

951

Views

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

Published on 29 Mar 2026 - 21:01

score 221 · Answer 5 · 2026-03-25 12:17:57

221

Views

General question about pumping lemma statement for regular languages

Published on 25 Mar 2026 - 12:17

score 59 · Answer 6 · 2015-12-02 18:12:28

59

Views

How to prove that $(a∪b)^⊆b^(ab^)^$? (formal languages)

Published on 02 Dec 2015 - 18:12

score 571 · Answer 7 · 2015-12-03 11:30:18

571

Views

For a regular language $L$, $Z(L)=\{x \in \Sigma ^* | \exists w \in \Sigma^*, xww\in L \}$, Is $Z(L)$ regular?

Published on 03 Dec 2015 - 11:30

score 873 · Answer 8 · 2026-03-29 20:55:14

873

Views

Checking if Post Correspondence Problem has a Solution

Published on 29 Mar 2026 - 20:55

score 1.8k · Answer 9 · 2026-03-27 21:23:32

1.8k

Views

Read-only Turing machine recognizes only regular languages?

Published on 27 Mar 2026 - 21:23

score 189 · Answer 10 · 2026-03-27 05:34:26

189

Views

Is $r(^∗)=r^∗$ valid regular expression?

Published on 27 Mar 2026 - 5:34

score 161 · Answer 11 · 2026-03-29 21:51:46

161

Views

Identify the class of language?

Published on 29 Mar 2026 - 21:51

score 21.5k · Answer 12 · 2026-03-29 22:35:29

21.5k

Views

What does arbitrary number mean?

Published on 29 Mar 2026 - 22:35

score 1.8k · Answer 13 · 2026-03-27 21:17:50

1.8k

Views

How to prove whether a language is decidable and/or semi-decidable (or neither) using reduction?

Published on 27 Mar 2026 - 21:17

score 63 · Answer 14 · 2026-03-25 16:14:53

63

Views

Chomsky Normal Form Transformation

Published on 25 Mar 2026 - 16:14

score 69 · Answer 15 · 2026-03-29 23:33:05

69

Views

Do the initial segments of the strings of a regular language form a regular language?

Published on 29 Mar 2026 - 23:33

List Question

State Change in a Turing Machine(Computer of Integer Function)

Is this property of infinite language correct?

Two claims about $L=\{a^n: n>o, \ n\text{ does not contain the digit } 7\}.$ that I didn't succeed to prove

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

General question about pumping lemma statement for regular languages

How to prove that $(a∪b)^⊆b^(ab^)^$? (formal languages)

For a regular language $L$, $Z(L)=\{x \in \Sigma ^* | \exists w \in \Sigma^*, xww\in L \}$, Is $Z(L)$ regular?

Checking if Post Correspondence Problem has a Solution

Read-only Turing machine recognizes only regular languages?

Is $r(^∗)=r^∗$ valid regular expression?

Identify the class of language?

What does arbitrary number mean?

How to prove whether a language is decidable and/or semi-decidable (or neither) using reduction?

Chomsky Normal Form Transformation

Do the initial segments of the strings of a regular language form a regular language?

Trending Questions

Popular # Hahtags

Popular Questions