The following pages link to Ludwig Staiger (Q259038):
Displayed 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Normality and finite-state dimension of Liouville numbers (Q285510) (← links)
- Learning regular omega languages (Q329611) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Codes, simplifying words, and open set condition (Q671261) (← links)
- The new minimum distance bounds of Goppa codes and their decoding (Q679428) (← links)
- Spectral-null codes and null spaces of Hadamard submatrices (Q679429) (← links)
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Decoding of block codes obtained from convolution codes (Q751626) (← links)
- Finite automata and randomness (Q777981) (← links)
- Finite-state \(\omega\)-languages (Q794443) (← links)
- Projection lemmas for \(\omega\)-languages (Q797297) (← links)
- Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
- (Q917522) (redirect page) (← links)
- Asymptotically exact uniform bounds for spectra of cosets of linear codes (Q917523) (← links)
- Combinatorial properties of the Hausdorff dimension (Q921037) (← links)
- Finite automata encoding geometric figures (Q995557) (← links)
- Topology on words (Q1019711) (← links)
- A topological characterization of random sequences (Q1029024) (← links)
- Maximality of codes in free monoids (Q1063122) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- On the square-root bound for QR-codes (Q1106810) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Ein Satz über die Entropie von Untermonoiden. (A theorem on the entropy of submonoids) (Q1113684) (← links)
- Accepting conditions for automata on \(\omega\)-languages (Q1116351) (← links)
- Convolutional codes for channels with fading (Q1177491) (← links)
- Weight enumerators of high-rate convolutional codes based on the Hamming code (Q1177492) (← links)
- Remarks on self-dual elliptic codes (Q1179333) (← links)
- Construction of partial unit-memory convolutional codes based on Reed-Muller codes (Q1179605) (← links)
- Existence of time-invariant convolutional codes with transmission rate \(2/c\) for \(c \geq{}4\) attaining the Costello bound (Q1179606) (← links)
- Asymptotic bit error probability for convolutional codes (Q1179615) (← links)
- Stability for the zigzag submonoids (Q1208713) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- (Q1387817) (redirect page) (← links)
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction (Q1387818) (← links)
- On syntactic congruences for \(\omega\)-languages (Q1391139) (← links)
- On the power of reading the whole infinite input tape (Q1592928) (← links)
- The Kolmogorov complexity of real numbers. (Q1607299) (← links)
- Type II codes over \(\mathbb F_4\) (Q1609396) (← links)
- On the values for factor complexity (Q1616983) (← links)
- Complementation of finitely ambiguous Büchi automata (Q1623004) (← links)
- Exact constructive and computable dimensions (Q1694005) (← links)
- Layerwise computability and image randomness (Q1694009) (← links)
- Randomness relative to Cantor expansions (Q1776777) (← links)
- Liouville, computable, Borel normal and Martin-Löf random numbers (Q1787950) (← links)
- Iterated function systems and control languages (Q1854440) (← links)
- Local Hausdorff dimension (Q1899101) (← links)
- Valuations, regular expressions, and fractal geometry (Q1908904) (← links)