39 results on '"Shallit, Jeffrey"'
Search Results
2. Shortest Repetition-Free Words Accepted by Automata
3. k-Automatic Sets of Rational Numbers
4. Enumeration and Decidable Properties of Automatic Sequences
5. Finite Orbits of Language Operations
6. Closures in Formal Languages and Kuratowski’s Theorem
7. Decision Problems for Convex Languages
8. Finite Automata, Palindromes, Powers, and Patterns
9. Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
10. The Frobenius Problem and Its Generalizations
11. Efficient Enumeration of Regular Languages
12. State Complexity and the Monoid of Transformations of a Finite Set
13. Minimal Covers of Formal Languages
14. Polynomial automaticity, context-free languages, and fixed points of morphisms (Extended abstract)
15. Automaticity: Properties of a measure of descriptional complexity : Extended abstract
16. Numeration systems, linear recurrences, and regular sets : Extended abstract
17. Open problems about regular languages, 35 years later
18. Additive Number Theory via Approximation by Regular Languages.
19. Remarks on Privileged Words.
20. Automatic Sets of Rational Numbers.
21. Filtrations of Formal Languages by Arithmetic Progressions.
22. Decision problems for convex languages
23. FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME.
24. Efficient enumeration of words in regular languages
25. On the State Complexity of the Shuffle of Regular Languages
26. Unrestricted State Complexity of Binary Operations on Regular Languages
27. State Complexity of Prefix Distance of Subregular Languages
28. Minimal and Reduced Reversible Automata
29. Compressibility of Finite Languages by Grammars
30. Square on Ideal, Closed and Free Languages
31. Star-Complement-Star on Prefix-Free Languages
32. Upper Bound on Syntactic Complexity of Suffix-Free Languages
33. Partial Derivative Automaton for Regular Expressions with Shuffle
34. Universal Disjunctive Concatenation and Star
35. On Simulation Cost of Unary Limited Automata
36. On the Computational Complexity of Problems Related to Distinguishability Sets
37. Complement on Free and Ideal Languages
38. Prefix-Free Subsets of Regular Languages and Descriptional Complexity
39. Unambiguity in Automata Theory
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.