Search

Your search keyword '"Shallit, Jeffrey"' showing total 82 results

Search Constraints

Start Over You searched for: Author "Shallit, Jeffrey" Remove constraint Author: "Shallit, Jeffrey" Publisher springer berlin heidelberg Remove constraint Publisher: springer berlin heidelberg
82 results on '"Shallit, Jeffrey"'

Search Results

2. Sets Represented as the Length-n Factors of a Word

3. Shortest Repetition-Free Words Accepted by Automata

4. Repetition Avoidance in Circular Factors

5. Subword Complexity and k-Synchronization

6. Decidability and Enumeration for Automatic Sequences: A Survey

7. Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences

8. On the Number of Unbordered Factors

9. The State Complexity of Star-Complement-Star

10. Automatic Theorem-Proving in Combinatorics on Words

11. k-Automatic Sets of Rational Numbers

12. Decidability and Shortest Strings in Formal Languages

13. Remarks on Separating Words

14. Enumeration and Decidable Properties of Automatic Sequences

15. Fife’s Theorem Revisited

16. Finite Orbits of Language Operations

17. On Lazy Representations and Sturmian Graphs

18. Closures in Formal Languages and Kuratowski’s Theorem

19. Decision Problems for Convex Languages

20. Finite Automata, Palindromes, Powers, and Patterns

21. Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time

22. The Frobenius Problem and Its Generalizations

23. Avoiding Approximate Squares

24. Efficient Enumeration of Regular Languages

25. Sturmian Graphs and a Conjecture of Moser

26. State Complexity and the Monoid of Transformations of a Finite Set

27. Enumerating Regular Expressions and Their Languages

28. A Generalization of Repetition Threshold

29. Minimal Covers of Formal Languages

30. Variations on a Theorem of Fine & Wilf

40. The ring of k-regular sequences

Catalog

Books, media, physical & digital resources