User Bader Abu Radi

2 votes

Accepted

Can PDA have empty stack transition?

answered Jan 9, 2021 at 22:24

2 votes

Another version of the 3-coloring decision problem?

answered Dec 19, 2020 at 9:36

2 votes

NP-hardness language

answered Dec 7, 2020 at 16:48

2 votes

Why do we create universal turing machines?

answered Dec 8, 2020 at 13:50

2 votes

Is L = { <M,w> | M is a TM and L(M)={w}} turing recognizable? And its complement?

answered Dec 12, 2020 at 15:04

2 votes

What is the language of Sigma^n? Confused about meanining

answered Dec 13, 2020 at 16:32

2 votes

Myhill-Nerode equivalence classes

answered Dec 13, 2020 at 23:52

2 votes

Regular Expression converted to NFA

answered Sep 27, 2017 at 16:39

2 votes

Accepted

Non-deterministic TM and problems in class P

answered Oct 3, 2017 at 10:38

2 votes

Every Regular Language Has a Finite Index

answered Nov 10, 2019 at 13:06

2 votes

Create NFA where |w|_a is divisible by 2 or |w|_b is divisible by 3

answered Feb 22 at 15:24

2 votes

Decide whether this Problem NPC or P?

answered Feb 22 at 15:49

2 votes

Accepted

Proof or Disproof if $ L $ is a Regular language then it has to be that $ L\leq HP $

answered Jan 27 at 20:34

2 votes

$A$ and $B$ two decision problems.If $A\le\ B$ then $\overline{B}\le\overline{A}$ is true?

answered Jan 28 at 10:40

2 votes

Accepted

Prove that there aren't any complete languages

answered Jan 31 at 9:25

2 votes

Accepted

Proof or disproof Fin = Fin-Complete $ Fin = \{ L \in \Sigma^* : |L| $ is finite and greater than 0 $ \} $

answered Feb 2 at 10:45

2 votes

Accepted

proof or disproof if $ L_1 \subseteq L_2 $ then $ L_1 \leq L_2 $

answered Jan 26 at 20:33

2 votes

Accepted

Problem about $NP \neq coNP$

answered Jan 15 at 17:47

2 votes

Accepted

NFA for the language that accepts binary strings ending with 00

answered Jan 15 at 18:19

2 votes

Languages having only one Myhill–Nerode equivalence class

answered Jan 10 at 18:30

2 votes

Accepted

How to construct complement of NFA universality?

answered Jan 11 at 14:00

2 votes

Can a universal worst case problem instance exist?

answered Aug 21 at 10:56

2 votes

Accepted

Unusual language in NP

answered Aug 18 at 10:38

2 votes

Accepted

set of words w such that M halts on w is decidable

answered Aug 18 at 13:15

2 votes

Accepted

The number of words that M doesn't accept is finite

answered Aug 19 at 10:19

2 votes

Accepted

Complete language in P∪{C,D}

answered Aug 19 at 10:56

2 votes

Accepted

Computation theory: decidability and Turing-recognition

answered Aug 4 at 15:09

2 votes

How does a minimal DFA ensure minimal computational cost?

answered Aug 4 at 22:05

2 votes

Why must 2 distinct strings go to the same state in a DFA?

answered Aug 7 at 14:35

2 votes

Provide a 2-state DFA for L={a}∗{b}∗ , the set of words of the form aa⋯abb⋯b

answered Feb 13 at 13:26

Stack Exchange Network

165 Answers

Can PDA have empty stack transition?

Another version of the 3-coloring decision problem?

NP-hardness language

Why do we create universal turing machines?

Is L = { <M,w> | M is a TM and L(M)={w}} turing recognizable? And its complement?

What is the language of Sigma^n? Confused about meanining

Myhill-Nerode equivalence classes

Regular Expression converted to NFA

Non-deterministic TM and problems in class P

Every Regular Language Has a Finite Index

Create NFA where |w|_a is divisible by 2 or |w|_b is divisible by 3

Decide whether this Problem NPC or P?

Proof or Disproof if $ L $ is a Regular language then it has to be that $ L\leq HP $

$A$ and $B$ two decision problems.If $A\le\ B$ then $\overline{B}\le\overline{A}$ is true?

Prove that there aren't any complete languages

Proof or disproof Fin = Fin-Complete $ Fin = \{ L \in \Sigma^* : |L| $ is finite and greater than 0 $ \} $

proof or disproof if $ L_1 \subseteq L_2 $ then $ L_1 \leq L_2 $

Problem about $NP \neq coNP$

NFA for the language that accepts binary strings ending with 00

Languages having only one Myhill–Nerode equivalence class

How to construct complement of NFA universality?

Can a universal worst case problem instance exist?

Unusual language in NP

set of words w such that M halts on w is decidable

The number of words that M doesn't accept is finite

Complete language in P∪{C,D}

Computation theory: decidability and Turing-recognition

How does a minimal DFA ensure minimal computational cost?

Why must 2 distinct strings go to the same state in a DFA?

Provide a 2-state DFA for L={a}∗{b}∗ , the set of words of the form aa⋯abb⋯b