The following pages link to Jeffrey O. Shallit (Q405317):
Displayed 50 items.
- (Q161495) (redirect page) (← links)
- (Q235694) (redirect page) (← links)
- Periodicity in rectangular arrays (Q344541) (← links)
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- On Prouhet's solution to the equal powers problem (Q387801) (← links)
- Counting the palstars (Q405318) (← links)
- A pattern sequence approach to Stern's sequence (Q409393) (← links)
- Avoiding 3/2-powers over the natural numbers (Q409482) (← links)
- Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
- On automatic subsets of the Gaussian integers (Q505037) (← links)
- Hankel matrices for the period-doubling sequence (Q505049) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Thue-Morse at multiples of an integer (Q538176) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- On Rowland's sequence (Q547798) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Correction to: Linear fractional transformations of continued fractions with bounded partial quotients (Q558164) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- A generalization of continued fractions (Q640879) (← links)
- Unfair permutations (Q648984) (← links)
- The complexity of smooth words on 2-letter alphabets (Q653325) (← links)
- On the vector space of the automatic reals (Q671363) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
- Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
- Automatic maps in exotic numeration systems (Q679441) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- On the worst case of three algorithms for computing the Jacobi symbol (Q752075) (← links)
- Behavior of various complexity functions (Q764361) (← links)
- Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences (Q776278) (← links)
- Efficient enumeration of words in regular languages (Q840765) (← links)
- Summation of series defined by counting blocks of digits (Q868903) (← links)
- Binary words containing infinitely many overlaps (Q869996) (← links)
- On Sturmian graphs (Q881581) (← links)
- Detecting patterns in finite regular and context-free languages (Q990125) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- Hamming distance for conjugates (Q1043598) (← links)
- Avoiding squares and overlaps over the natural numbers (Q1045019) (← links)
- (Q1063052) (redirect page) (← links)
- On infinite products associated with sums of digits (Q1063054) (← links)
- Number-theoretic functions which are equivalent to number of divisors (Q1064776) (← links)
- A generalization of automatic sequences (Q1114405) (← links)
- Wire bending (Q1114763) (← links)
- Simple continued fractions for some irrational numbers. II (Q1161770) (← links)
- Folded continued fractions (Q1183266) (← links)