kviiri's user avatar
kviiri's user avatar
kviiri's user avatar
kviiri
  • Member for 3 years, 1 month
  • Last seen this week
13 votes

Can a deterministic finite automaton ever go into an infinite loop?

12 votes

Real life examples of *zero* weight edges in graphs

6 votes

Why the 127 encodings of ASCII needed to be extended to 256?

6 votes
Accepted

Adding a finite set to a non-regular language

4 votes

Find largest set of players that never played against eachother

4 votes
Accepted

Turing Machines time complexity with regard to the NP and P problem

3 votes

Can we choose different words for pumping Lemma to prove $a^n b^m:n\neq m$ is not regular?

2 votes
Accepted

Can a non-regular language have a regular grammar?

2 votes
Accepted

What happens to a Turing Machine if it enters final state but the input is not yet read completely?

2 votes

Can any language be expressed by regular expression?

2 votes

How is it possible that for infinite L in R exists subset L' which is not in Re?

2 votes
Accepted

TM with double-infinity tape semi-decides the same languages as classical TM

2 votes

Proving that the language $\{ w^n\mid w \in \{0,1\}^∗, \, n \ge 2 \}$ is not regular

2 votes
Accepted

Why is the Turing machine rather than the finite automaton the main model for computation if computers have finite memory?

1 vote

All words containing at least twice as many zeroes as ones

1 vote
Accepted

Why if L and ¬L (Complement of L) are turing-recognized both are turing-decidable?

1 vote
Accepted

Minimum pumping length of finite language

1 vote
Accepted

Is this explanation confusing NP-hard and NP-complete?

1 vote

Design a DFA that accepts numbers whose sum of digits is $2 \mod 3$

1 vote

NFA has power to be in several states at once implies NFA has ability to guess about its input. How?

1 vote

Can I solve pumping lemma for context free language proofs using examples?

1 vote

Understanding the application of the pumping lemma to show that $L=\{0^{2^p}, p \geq 0\}$ is not regular

1 vote

Halting problem is undecidable proof-:

1 vote

What is the point of encoding universal turing machines?

1 vote

How could Penrose's universal Turing machine with a binary alphabet work?

1 vote
Accepted

If the halting problem is NP hard, would P = NP with a hypercomputer capable of computing the halting problem in polynomial time?

1 vote
Accepted

Context-free pumping lemma of $a^nb^n$

0 votes
Accepted

show that $L=\{a^*\}\cup\{b^ja^{n^2}|0<j,1\leq n \}$ Holds the pumping lemma for context-free languages

0 votes

Halting problem logic must be wrong

0 votes
Accepted

How to count the leaves of a tree without a outside function counter?