Tag check-my-answer - Это страница 5 - GeneraCodice

How to prove this language is not regular (via Fooling Set)

https://www.generacodice.com/ru/articolo/1589368/how-to-prove-this-language-is-not-regular-via-fooling-set
  formal-languages  -  regular-languages  -  check-my-answer
cs.stackexchange cs.stackexchange

Is Goedel's 1st theorem not algorithmically derivable?

https://www.generacodice.com/ru/articolo/1589086/is-goedel-s-1st-theorem-not-algorithmically-derivable
  proof-assistants  -  incompleteness  -  check-my-answer
cs.stackexchange cs.stackexchange

Find an upper bound for $T(n)=T(\sqrt{n})+10\log\log n$

https://www.generacodice.com/ru/articolo/1585893/find-an-upper-bound-for-t-n-t-sqrt-n-10-log-log-n
  asymptotics  -  recurrence-relation  -  check-my-answer
cs.stackexchange cs.stackexchange

Proof Review: Integer Factorization is in NP

https://www.generacodice.com/ru/articolo/1581296/proof-review-integer-factorization-is-in-np
  turing-machines  -  factoring  -  check-my-answer
cs.stackexchange cs.stackexchange

Proving the loop invariant for a simple program in Hoare logic

https://www.generacodice.com/ru/articolo/1580874/proving-the-loop-invariant-for-a-simple-program-in-hoare-logic
  loop-invariants  -  hoare-logic  -  check-my-answer
cs.stackexchange cs.stackexchange

$ADD = {x=y+z}$ with $x, y, z$ binary integers, and $x$ is the sum of $y$ and $z$. Pumping lemma to show that $ADD$ is not regular

https://www.generacodice.com/ru/articolo/1579787/add-x-y-z-with-x-y-z-binary-integers-and-x-is-the-sum-of-y-and-z-pumping-lemma-to-show-that-add-is-not-regular
  finite-automata  -  pumping-lemma  -  check-my-answer
cs.stackexchange cs.stackexchange

Every AVL tree may be red black tree

https://www.generacodice.com/ru/articolo/1562117/every-avl-tree-may-be-red-black-tree
  data-structures  -  binary-trees  -  search-trees  -  balanced-search-trees  -  check-my-answer
cs.stackexchange cs.stackexchange

Sorting an “almost sorted” array in sub linear time

https://www.generacodice.com/ru/articolo/1561869/sorting-an-almost-sorted-array-in-sub-linear-time
  sorting  -  algorithms  -  check-my-answer
cs.stackexchange cs.stackexchange

Optimal prefix code: full binary tree existence

https://www.generacodice.com/ru/articolo/1560576/optimal-prefix-code-full-binary-tree-existence
  proof-techniques  -  check-my-answer
cs.stackexchange cs.stackexchange

Simpler proof of Rabin's Compression Theorem?

https://www.generacodice.com/ru/articolo/1559392/simpler-proof-of-rabin-s-compression-theorem
  complexity-theory  -  complexity-classes  -  check-my-answer
cs.stackexchange cs.stackexchange
Результаты найдены: 68
scroll top