75 results on '"Shallit, Jeffrey"'
Search Results
2. Record-setters in the Stern sequence
3. Strongly K-Recursive Sequences
4. Rarefied Thue-Morse sums via automata theory and logic
5. Mesosome avoidance
6. Prefixes of the Fibonacci Word
7. Computational aspects of sturdy and flimsy numbers
8. Lie complexity of words
9. Properties of a class of Toeplitz words
10. Sumsets associated with Beatty sequences
11. Decidability and k-regular sequences
12. Maximal state complexity and generalized de Bruijn words
13. Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture
14. Robbins and Ardila meet Berstel
15. Ostrowski-automatic sequences: Theory and applications
16. Avoidance of split overlaps
17. Borders, palindrome prefixes, and square prefixes
18. Lengths of words accepted by nondeterministic finite automata
19. Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences
20. New bounds on antipowers in words
21. Unique decipherability in formal languages
22. Subword complexity and power avoidance
23. Critical exponents of infinite balanced words
24. The number of valid factorizations of Fibonacci prefixes
25. Preface
26. Abelian-square-rich words
27. Hankel matrices for the period-doubling sequence
28. Periodicity in rectangular arrays
29. Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
30. Palindromic rich words and run-length encodings
31. Avoiding 3/2-powers over the natural numbers
32. A pattern sequence approach to Stern’s sequence
33. Thue–Morse at multiples of an integer
34. Inverse star, borders, and palstars
35. Decision problems for convex languages
36. Detecting patterns in finite regular and context-free languages
37. On NFAs where all states are final, initial, or both
38. Detecting palindromes, patterns and borders in regular languages
39. Avoiding squares and overlaps over the natural numbers
40. Efficient enumeration of words in regular languages
41. Periodicity, repetitions, and orbits of an automatic sequence
42. Hamming distance for conjugates
43. State complexity of unique rational operations
44. Decimations of languages and state complexity
45. Words avoiding repetitions in arithmetic progressions
46. Every real number greater than 1 is a critical exponent
47. On Sturmian graphs
48. A generalization of repetition threshold
49. Avoiding large squares in infinite binary words
50. On the iteration of certain quadratic maps over GF(p)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.