Created
February 6, 2018 08:30
-
-
Save hediet/27946724f641052b9a5f927d1dc2b0a8 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function tex(str: TemplateStringsArray, ...data: string[]) { } | |
const c = Sigma* *1 | |
const Sigma = "uiae"; | |
const SigmaS = ""; | |
const x = | |
( | |
<def> | |
Ein {Sigma}-{Sigma}-Advice (Hinweis) {A} ist eine Abbildung | |
{A : Sigma* -> Pot(Gamma*)} | |
mit {forall(@w in Sigma*): A(w) `subseteq` Sigma^count(w)} | |
Dann gilt {Lang(LRT, Adv(A)) = Lang(LRT)}. | |
</def> | |
<satz> | |
{{ | |
const log2(n) = log(2, n); | |
const A: Word => Set = mathcal('A'); | |
const a: Word; | |
const Ai = n => sub(A, i); | |
}} | |
Für {A(w) := ones(2^(floor(log2(w.len) - 1)), w.len) \in B*} | |
Für {A(w) := a(1)...a(w.len) \in B*} mit | |
<p> | |
{a(i) := | |
cases( | |
case(chr(1), `falls {exists(j \in N0): i = 2^j}`), | |
case(chr(0), `sonst`) | |
) | |
} | |
</p> | |
Es gilt: | |
<p> | |
{forall(@n \in N0) : | |
count(factor(Sigma^n, rel1(L))) | |
<= | |
count(f(C, d, Sigma^n)) | |
<= | |
count(Qof(C))^d(n) | |
} | |
</p> | |
</satz> | |
) | |
tex`\Gamma`; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment