The following pages link to On the length of word chains (Q1108812):
Displaying 16 items.
- Generalized wordlength patterns and strength (Q389411) (← links)
- Effective designs based on individual word length patterns (Q496475) (← links)
- Optimal word chains for the Thue-Morse word (Q582129) (← links)
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- Tight lower bounds on the length of word chains (Q915454) (← links)
- The structure of generalized code chains (Q1034388) (← links)
- A note on word chains and regular languages (Q1115632) (← links)
- Processor-efficient exponentiation in finite fields (Q1186580) (← links)
- The number of minimal word chains computing the Thue-Morse word (Q1201862) (← links)
- Generalized code chains with certain properties (Q1749716) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- A note on antichains of words (Q1909962) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Asymptotical behaviour of some non-uniform measures (Q3833644) (← links)
- (Q4941160) (← links)
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243) (← links)
