Jeffrey O. Shallit

442 papers A* 7A 9B 9C 37Misc 2Journal 340Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A self-generating sequence. Theor. Comput. Sci. Benoit Cloitre, Jeffrey O. Shallit
2026	J	`jnl`	Beatty sequences for a quadratic irrational: Decidability and applications. Discret. Math. Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic
2026	J	`jnl`	Christoffel matrices and Sturmian determinants. RAIRO Theor. Informatics Appl. Christophe Reutenauer, Jeffrey O. Shallit
2026	J	`jnl`	Complexity of Linear Subsequences of Fibonacci-Automatic Sequences. CoRR Delaram Moradi, Narad Rampersad, Jeffrey O. Shallit
2026	J	`jnl`	Computing the base-b representation of quadratic irrationals using automata. Theor. Comput. Sci. Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit
2026	J	`jnl`	Prefixes of the Fibonacci word. Theor. Comput. Sci. Jeffrey O. Shallit
2026	J	`jnl`	Running maximum of a k-regular sequence. Inf. Process. Lett. Jeffrey O. Shallit, Élise Vandomme
2026	J	`jnl`	State Complexity of Shifts of the Fibonacci Word. CoRR Delaram Moradi, Pierre Popoli, Jeffrey O. Shallit, Ingrid Vukusic
2026	J	`jnl`	State complexity of the minimal star basis. Theor. Comput. Sci. Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit
2025	J	`jnl`	An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory. CoRR Jeffrey O. Shallit
2025	J	`jnl`	Balanced Fibonacci word rectangles, and beyond. CoRR Jeffrey O. Shallit, Ingrid Vukusic
2025	J	`jnl`	Cloitre's Self-Generating Sequence. CoRR Jeffrey O. Shallit
2025	J	`jnl`	Combinatorics on words and generating Dirichlet series of automatic sequences. Discret. Math. Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti
2025	J	`jnl`	Complement Avoidance in Binary Words. Electron. J. Comb. James D. Currie, L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Complexity of Linear Subsequences of CoRR Delaram Moradi, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. CoRR Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti
2025	J	`jnl`	New properties of the φ-representation of integers. CoRR Jeffrey O. Shallit, Ingrid Vukusic
2025	B	`conf`	On Palindromic Periodicities. CPM Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson
2025	J	`jnl`	On a sequence of Kimberling and its relationship to the Tribonacci word. CoRR L'ubomíra Dvoráková, Edita Pelantová, Jeffrey O. Shallit
2025	J	`jnl`	Repetition Factorization of Automatic Sequences. Int. J. Found. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Xinhao Xu
2025	J	`jnl`	Rudin-Shapiro Sums Via Automata Theory and Logic. Theory Comput. Syst. Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Self-Verifying Predicates in Büchi Arithmetic. CoRR Mazen Khodier, Luke Schaeffer, Jeffrey O. Shallit
2025	C	`conf`	Self-verifying Predicates in Büchi Arithmetic. CIAA Mazen Khodier, Luke Schaeffer, Jeffrey O. Shallit
2025	J	`jnl`	The Hurt-Sada Array and Zeckendorf Representations. CoRR Jeffrey O. Shallit
2025	J	`jnl`	The Narayana Morphism and Related Words. CoRR Jeffrey O. Shallit
2025	J	`jnl`	The Reflection Complexity of Sequences Over Finite Alphabets. Theory Comput. Syst. Jean-Paul Allouche, John M. Campbell, Shuo Li, Jeffrey O. Shallit, Manon Stipulanti
2025	J	`jnl`	The Tribonacci constant and finite automata. CoRR Jeffrey O. Shallit
2024	—	`conf`	Additive Word Complexity and Walnut. FSTTCS Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti
2024	J	`jnl`	Additive word complexity and Walnut. CoRR Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti
2024	J	`jnl`	Beatty Sequences for a Quadratic Irrational: Decidability and Applications. CoRR Luke Schaeffer, Jeffrey O. Shallit, Stefan Zorcic
2024	J	`jnl`	Christoffel Matrices and Sturmian Determinants. CoRR Christophe Reutenauer, Jeffrey O. Shallit
2024	J	`jnl`	Combinatorics on words and generating Dirichlet series of automatic sequences. CoRR Jean-Paul Allouche, Jeffrey O. Shallit, Manon Stipulanti
2024	J	`jnl`	Consecutive Power Occurrences in Sturmian Words. CoRR Jason P. Bell, Christian Schulz, Jeffrey O. Shallit
2024	J	`jnl`	Decidability for Sturmian words. Log. Methods Comput. Sci. Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
2024	J	`jnl`	Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. SIAM J. Discret. Math. James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2024	J	`jnl`	Power-free complementary binary morphisms. J. Comb. Theory, Ser. A Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
2024	J	`jnl`	Proving properties of some greedily-defined integer recurrences via automata theory. Theor. Comput. Sci. Jeffrey O. Shallit
2024	J	`jnl`	Record-setters in the Stern sequence. Discret. Math. Ali Keramatipour, Jeffrey O. Shallit
2024	J	`jnl`	Repetition Threshold for Binary Automatic Sequences. CoRR Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2024	J	`jnl`	Runs in Paperfolding Sequences. CoRR Jeffrey O. Shallit
2024	J	`jnl`	Some Remarks on Palindromic Periodicities. CoRR Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson
2024	C	`conf`	State Complexity of the Minimal Star Basis. CIAA Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit
2024	J	`jnl`	Strongly k-recursive sequences. CoRR Daniel Krenn, Jeffrey O. Shallit
2024	J	`jnl`	The Repetition Threshold for Rote Sequences. CoRR Nicolas Ollinger, Jeffrey O. Shallit
2024	J	`jnl`	The reflection complexity of sequences over finite alphabets. CoRR Jean-Paul Allouche, John M. Campbell, Jeffrey O. Shallit, Manon Stipulanti
2024	C	`conf`	Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. CIAA Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit
2024	J	`jnl`	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals. CoRR Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit
2023	J	`jnl`	A Dombi Counterexample with Positive Lower Density. CoRR Jeffrey O. Shallit
2023	—	`conf`	A General Approach to Proving Properties of Fibonacci Representations via Automata Theory. AFL Jeffrey O. Shallit, Sonja Linghui Shan
2023	J	`jnl`	Antisquares and Critical Exponents. Discret. Math. Theor. Comput. Sci. Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Automatic sequences in negative bases and proofs of some conjectures of shevelev. RAIRO Theor. Informatics Appl. Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang
2023	—	`conf`	Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Mesosome avoidance. Inf. Process. Lett. Robert Cummings, Jeffrey O. Shallit, Paul Staadecker
2023	J	`jnl`	New constructions for 3-free and 3 CoRR Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
2023	J	`jnl`	Note on a Fibonacci parity sequence. Cryptogr. Commun. Jeffrey O. Shallit
2023	J	`jnl`	Prefixes of the Fibonacci word. CoRR Jeffrey O. Shallit
2023	J	`jnl`	Proof of Irvine's Conjecture via Mechanized Guessing. CoRR Jeffrey O. Shallit
2023	J	`jnl`	Proof of a conjecture of Krawchuk and Rampersad. CoRR Jeffrey O. Shallit
2023	J	`jnl`	Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Proving Properties of φ-Representations with the Walnut Theorem-Prover. CoRR Jeffrey O. Shallit
2023	C	`conf`	Proving Results About OEIS Sequences with Walnut. CICM Jeffrey O. Shallit
2023	J	`jnl`	Proving properties of some greedily-defined integer recurrences via automata theory. CoRR Jeffrey O. Shallit
2023	J	`jnl`	Pseudoperiodic Words and a Question of Shevelev. Discret. Math. Theor. Comput. Sci. Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
2023	J	`jnl`	Rarefied Thue-Morse Sums Via Automata Theory and Logic. CoRR Jeffrey O. Shallit
2023	J	`jnl`	Repetition factorization of automatic sequences. CoRR Jeffrey O. Shallit, Xinhao Xu
2023	J	`jnl`	Rudin-Shapiro Sums Via Automata Theory and Logic. CoRR Narad Rampersad, Jeffrey O. Shallit
2023	—	`conf`	Rudin-Shapiro Sums via Automata Theory and Logic. WORDS Narad Rampersad, Jeffrey O. Shallit
2023	—	`conf`	Smallest and Largest Block Palindrome Factorizations. WORDS Daniel Gabric, Jeffrey O. Shallit
2023	J	`jnl`	Smallest and Largest Block Palindrome Factorizations. CoRR Daniel Gabric, Jeffrey O. Shallit
2023	J	`jnl`	Some Fibonacci-Related Sequences. CoRR Benoit Cloitre, Jeffrey O. Shallit
2023	C	`conf`	Transduction of Automatic Sequences and Applications. CIAA Jeffrey O. Shallit, Anatoly Zavyalov
2023	J	`jnl`	Transduction of Automatic Sequences and Applications. CoRR Jeffrey O. Shallit, Anatoly Zavyalov
2022	J	`jnl`	Antisquares and Critical Exponents. CoRR Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev. CoRR Jeffrey O. Shallit, Sonja Linghui Shan, Kai-Hsiang Yang
2022	J	`jnl`	Automatic sequences of rank two. RAIRO Theor. Informatics Appl. Jason P. Bell, Jeffrey O. Shallit
2022	J	`jnl`	Complement Avoidance in Binary Words. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Computational aspects of sturdy and flimsy numbers. Theor. Comput. Sci. Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
2022	J	`jnl`	Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton. Electron. J. Comb. Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Counterexamples to a Conjecture of Dombi in Additive Number Theory. CoRR Jason P. Bell, Jeffrey O. Shallit
2022	J	`jnl`	Decidability and Theor. Comput. Sci. Daniel Krenn, Jeffrey O. Shallit
2022	B	`conf`	Decidability for Sturmian Words. CSL Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
2022	J	`jnl`	Intertwining of Complementary Thue-Morse Factors. CoRR Jeffrey O. Shallit
2022	J	`jnl`	Lie complexity of words. Theor. Comput. Sci. Jason P. Bell, Jeffrey O. Shallit
2022	J	`jnl`	Maximal state complexity and generalized de Bruijn words. Inf. Comput. Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
2022	J	`jnl`	Note on a Fibonacci Parity Sequence. CoRR Jeffrey O. Shallit
2022	J	`jnl`	Properties of a Ternary Infinite Word. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Properties of a class of Toeplitz words. Theor. Comput. Sci. Gabriele Fici, Jeffrey O. Shallit
2022	J	`jnl`	Pseudoperiodic Words and a Question of Shevelev. CoRR Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
2022	J	`jnl`	Quotients of Palindromic and Antipalindromic Numbers. CoRR James Haoyu Bai, Joseph Meleshko, Samin Riasat, Jeffrey O. Shallit
2022	J	`jnl`	Some Tribonacci Conjectures. CoRR Jeffrey O. Shallit
2022	J	`jnl`	Sumsets associated with Beatty sequences. Discret. Math. Phakhinkon Phunphayap, Prapanpong Pongsriiam, Jeffrey O. Shallit
2022	J	`jnl`	Sumsets of Wythoff sequences, Fibonacci representation, and beyond. Period. Math. Hung. Jeffrey O. Shallit
2022	J	`jnl`	The First-Order Theory of Binary Overlap-Free Words is Decidable. CoRR Luke Schaeffer, Jeffrey O. Shallit
2022	B	`conf`	Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). CPM Jeffrey O. Shallit
2021	J	`jnl`	Additive Number Theory via Automata and Logic. CoRR Jeffrey O. Shallit
2021	J	`jnl`	An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Automata, Palindromes, and Reversed Subwords. J. Autom. Lang. Comb. Lukas Fleischer, Jeffrey O. Shallit
2021	J	`jnl`	Automatic Sequences of Rank Two. CoRR Jason P. Bell, Jeffrey O. Shallit
2021	J	`jnl`	Avoidance of split overlaps. Discret. Math. Daniel Gabric, Jeffrey O. Shallit, Xiaofeng Zhong
2021	J	`jnl`	Borders, palindrome prefixes, and square prefixes. Inf. Process. Lett. Daniel Gabric, Jeffrey O. Shallit
2021	Misc	`conf`	Computational Fun with Sturdy and Flimsy Numbers. FUN Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
2021	J	`jnl`	Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton. CoRR Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Decidability for Sturmian words. CoRR Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit
2021	—	`ch.`	Enumerating regular expressions and their languages. Handbook of Automata Theory (I.) Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit
2021	J	`jnl`	Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2021	J	`jnl`	Frobenius Numbers and Automatic Sequences. CoRR Jeffrey O. Shallit
2021	J	`jnl`	Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences. CoRR Jeffrey O. Shallit
2021	J	`jnl`	Lie complexity of words. CoRR Jason P. Bell, Jeffrey O. Shallit
2021	J	`jnl`	Mesosome Avoidance. CoRR Robert Cummings, Jeffrey O. Shallit, Paul Staadecker
2021	J	`jnl`	Ostrowski-automatic sequences: Theory and applications. Theor. Comput. Sci. Aseem R. Baranwal, Luke Schaeffer, Jeffrey O. Shallit
2021	J	`jnl`	Properties of a Class of Toeplitz Words. CoRR Gabriele Fici, Jeffrey O. Shallit
2021	J	`jnl`	Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. Int. J. Found. Comput. Sci. Lukas Fleischer, Jeffrey O. Shallit
2021	J	`jnl`	Robbins and Ardila meet Berstel. Inf. Process. Lett. Jeffrey O. Shallit
2021	C	`conf`	Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs. CIAA Jeffrey O. Shallit
2021	—	`conf`	Synchronized Sequences. WORDS Jeffrey O. Shallit
2021	J	`jnl`	The simplest binary word with only three squares. RAIRO Theor. Informatics Appl. Daniel Gabric, Jeffrey O. Shallit
2020	J	`jnl`	A Frameless 2-Coloring of the Plane Lattice. CoRR Craig S. Kaplan, Jeffrey O. Shallit
2020	J	`jnl`	Abelian Complexity and Synchronization. CoRR Jeffrey O. Shallit
2020	J	`jnl`	Additive Number Theory via Approximation by Regular Languages. Int. J. Found. Comput. Sci. Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit
2020	J	`jnl`	Additive Number Theory via Automata Theory. Theory Comput. Syst. Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2020	J	`jnl`	An inequality for the number of periods in a word. CoRR Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit
2020	J	`jnl`	Avoidance of split overlaps. CoRR Daniel Gabric, Jeffrey O. Shallit
2020	J	`jnl`	Computational Aspects of Sturdy and Flimsy Numbers. CoRR Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman
2020	J	`jnl`	Decidability and k-Regular Sequences. CoRR Daniel Krenn, Jeffrey O. Shallit
2020	A	`conf`	Existential Length Universality. STACS Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
2020	J	`jnl`	Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020	J	`jnl`	Extremal overlap-free and extremal β-free binary words. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020	J	`jnl`	Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. Aaron Potechin, Jeffrey O. Shallit
2020	J	`jnl`	New bounds on antipowers in words. Inf. Process. Lett. Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit
2020	J	`jnl`	Queens in Exile: Non-attacking Queens on Infinite Chess Boards. Electron. J. Comb. F. Michel Dekking, Jeffrey O. Shallit, Neil J. A. Sloane
2020	J	`jnl`	Robbins and Ardila meet Berstel. CoRR Jeffrey O. Shallit
2020	J	`jnl`	String Attractors for Automatic Sequences. CoRR Jeffrey O. Shallit
2020	J	`jnl`	Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture. CoRR Jeffrey O. Shallit
2020	J	`jnl`	Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences. Discret. Math. Jean-Paul Allouche, Jeffrey O. Shallit, Zhi-Xiong Wen, Wen Wu, Jie-Meng Zhang
2020	J	`jnl`	Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond. CoRR Jeffrey O. Shallit
2020	J	`jnl`	The Largest Entry in the Inverse of a Vandermonde Matrix. CoRR Carlo Sanna, Jeffrey O. Shallit, Shun Zhang
2020	J	`jnl`	The Simplest Binary Word with Only Three Squares. CoRR Daniel Gabric, Jeffrey O. Shallit
2020	C	`conf`	The State Complexity of Lexicographically Smallest Words and Computing Successors. DLT Lukas Fleischer, Jeffrey O. Shallit
2020	J	`jnl`	The State Complexity of Lexicographically Smallest Words and Computing Successors. CoRR Lukas Fleischer, Jeffrey O. Shallit
2020	J	`jnl`	Unique decipherability in formal languages. Theor. Comput. Sci. Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
2019	J	`jnl`	Automatic sequences are also non-uniformly morphic. CoRR Jean-Paul Allouche, Jeffrey O. Shallit
2019	J	`jnl`	Borders, Palindrome Prefixes, and Square Prefixes. CoRR Daniel Gabric, Jeffrey O. Shallit
2019	J	`jnl`	Circular critical exponents for Thue-Morse factors. RAIRO Theor. Informatics Appl. Jeffrey O. Shallit, Ramin Zarifi
2019	—	`conf`	Circularly Squarefree Words and Unbordered Conjugates: A New Approach. WORDS Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit
2019	J	`jnl`	Circularly squarefree words and unbordered conjugates: a new approach. CoRR Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit
2019	J	`jnl`	Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2019	J	`jnl`	Continuants, Run Lengths, and Barry's Modified Pascal Triangle. Electron. J. Comb. Lukas Spiegelhofer, Jeffrey O. Shallit
2019	—	`conf`	Critical Exponent of Infinite Balanced Words via the Pell Number System. WORDS Aseem R. Baranwal, Jeffrey O. Shallit
2019	J	`jnl`	Critical exponent of infinite balanced words via the Pell number system. CoRR Aseem R. Baranwal, Jeffrey O. Shallit
2019	J	`jnl`	Critical exponents of infinite balanced words. Theor. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
2019	—	`conf`	Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
2019	J	`jnl`	Generalized de Bruijn words and the state complexity of conjugate sets. CoRR Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
2019	J	`jnl`	New Bounds on Antipowers in Binary Words. CoRR Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit
2019	—	`conf`	New Results on Pseudosquare Avoidance. WORDS Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	J	`jnl`	New results on pseudosquare avoidance. CoRR Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	A*	`conf`	Optimal Regular Expressions for Permutations. ICALP Antonio Molina Lovett, Jeffrey O. Shallit
2019	—	`conf`	Repetitions in Infinite Palindrome-Rich Words. WORDS Aseem R. Baranwal, Jeffrey O. Shallit
2019	J	`jnl`	Repetitions in infinite palindrome-rich words. CoRR Aseem Raj Baranwal, Jeffrey O. Shallit
2019	J	`jnl`	Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2019	J	`jnl`	Subword complexity and power avoidance. Theor. Comput. Sci. Jeffrey O. Shallit, Arseny M. Shur
2019	J	`jnl`	The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations. Exp. Math. Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, Jeffrey O. Shallit
2019	J	`jnl`	The number of valid factorizations of Fibonacci prefixes. Theor. Comput. Sci. Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit
2019	J	`jnl`	Waring's Theorem for Binary Powers. Comb. Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit
2019	J	`jnl`	Words Avoiding Reversed Factors, Revisited. CoRR Lukas Fleischer, Jeffrey O. Shallit
2019	J	`jnl`	Words With Few Palindromes, Revisited. CoRR Lukas Fleischer, Jeffrey O. Shallit
2018	C	`conf`	Additive Number Theory via Approximation by Regular Languages. DLT Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Additive Number Theory via Approximation by Regular Languages. CoRR Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Circular critical exponents for Thue-Morse factors. CoRR Jeffrey O. Shallit, Ramin Zarifi
2018	J	`jnl`	Cobham's Theorem and Automaticity. CoRR Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2018	J	`jnl`	Common factors in automatic and Sturmian sequences. CoRR Narad Rampersad, Jeffrey O. Shallit
2018	C	`conf`	Counting Subwords and Regular Languages. DLT Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Counting Subwords and Regular Languages. CoRR Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Critical exponents of infinite balanced words. CoRR Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme
2018	B	`conf`	Lagrange's Theorem for Binary Squares. MFCS P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit
2018	J	`jnl`	Lengths of Words Accepted by Nondeterministic Finite Automata. CoRR Aaron Potechin, Jeffrey O. Shallit
2018	J	`jnl`	Optimal Regular Expressions for Permutations. CoRR Antonio Molina Lovett, Jeffrey O. Shallit
2018	J	`jnl`	Preface. Inf. Comput. Jeffrey O. Shallit, Alexander Okhotin
2018	A*	`conf`	Rollercoasters and Caterpillars. ICALP Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Rollercoasters and Caterpillars. CoRR Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Subword complexity and power avoidance. CoRR Jeffrey O. Shallit, Arseny M. Shur
2018	A	`conf`	Sums of Palindromes: an Approach via Automata. STACS Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2018	J	`jnl`	Waring's Theorem for Binary Powers. CoRR Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit
2017	J	`jnl`	A Class of Exponential Sequences with Shift-Invariant Discriminators. CoRR Sajed Haque, Jeffrey O. Shallit
2017	J	`jnl`	A Taxonomy of Morphic Sequences. CoRR Jean-Paul Allouche, Julien Cassaigne, Jeffrey O. Shallit, Luca Q. Zamboni
2017	J	`jnl`	Abelian-Square-Rich Words. CoRR Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit
2017	J	`jnl`	Abelian-square-rich words. Theor. Comput. Sci. Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit
2017	J	`jnl`	Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theor. Comput. Sci. Chen Fei Du, Hamoon Mousavi, Eric Rowland, Luke Schaeffer, Jeffrey O. Shallit
2017	J	`jnl`	Disjoint covering systems and the reversion of the Möbius series. CoRR Ian P. Goulden, L. Bruce Richmond, Jeffrey O. Shallit
2017	J	`jnl`	Existential length universality. CoRR Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
2017	A	`conf`	Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit
2017	J	`jnl`	Lagrange's Theorem for Binary Squares. CoRR Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit
2017	—	`conf`	Overpals, Underlaps, and Underpals. WORDS Aayush Rajasekaran, Narad Rampersad, Jeffrey O. Shallit
2017	J	`jnl`	Periodicity in rectangular arrays. Inf. Process. Lett. Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith
2017	J	`jnl`	Preface. J. Autom. Lang. Comb. Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit
2017	J	`jnl`	Sums of Palindromes: an Approach via Nested-Word Automata. CoRR Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith
2017	J	`jnl`	The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations. CoRR Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, Jeffrey O. Shallit
2017	—	`ed.`	The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Jeffrey O. Shallit
2017	C	`conf`	Undecidability and Finite Automata. DLT Jörg Endrullis, Jeffrey O. Shallit, Tim Smith
2017	J	`jnl`	Undecidability and Finite Automata. CoRR Jörg Endrullis, Jeffrey O. Shallit, Tim Smith
2017	J	`jnl`	When is an automatic set an additive basis? CoRR Jason P. Bell, Kathryn Hare, Jeffrey O. Shallit
2016	J	`jnl`	Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. Electron. J. Comb. Luke Schaeffer, Jeffrey O. Shallit
2016	J	`jnl`	Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. Int. J. Found. Comput. Sci. Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit
2016	J	`jnl`	Decision algorithms for Fibonacci-automatic Words, I: Basic results. RAIRO Theor. Informatics Appl. Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit
2016	—	`ed.`	Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings DCFS Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit
2016	J	`jnl`	Discriminators and k-Regular Sequences. CoRR Sajed Haque, Jeffrey O. Shallit
2016	J	`jnl`	Discriminators and k-Regular Sequences. Integers Sajed Haque, Jeffrey O. Shallit
2016	J	`jnl`	Length of the continued logarithm algorithm on rational inputs. CoRR Jeffrey O. Shallit
2016	J	`jnl`	Minimal Elements for the Prime Numbers. Exp. Math. Curtis Bright, Raymond Devillers, Jeffrey O. Shallit
2016	J	`jnl`	Minimum Critical Exponents for Palindromes. CoRR Jeffrey O. Shallit
2016	J	`jnl`	On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations. CoRR Jean-Paul Allouche, Jeffrey O. Shallit
2016	J	`jnl`	Palindromic rich words and run-length encodings. Inf. Process. Lett. Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
2016	J	`jnl`	Periodicity in Rectangular Arrays. CoRR Jeffrey O. Shallit, Taylor J. Smith
2016	A	`conf`	Periods and Borders of Random Words. STACS Stepan Holub, Jeffrey O. Shallit
2016	J	`jnl`	Remarks on Privileged Words. Int. J. Found. Comput. Sci. Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki, Jeffrey O. Shallit
2015	C	`conf`	A New Approach to the Paperfolding Sequences. CiE Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit
2015	J	`jnl`	Automatic Sets of Rational Numbers. Int. J. Found. Comput. Sci. Eric Rowland, Jeffrey O. Shallit
2015	J	`jnl`	Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences. CoRR Luke Schaeffer, Jeffrey O. Shallit
2015	—	`ed.`	Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings DCFS Jeffrey O. Shallit, Alexander Okhotin
2015	C	`conf`	Factorization in Formal Languages. DLT Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
2015	J	`jnl`	Factorization in Formal Languages. CoRR Paul Bell, Daniel Reidenbach, Jeffrey O. Shallit
2015	J	`jnl`	Fractional coverings, greedy coverings, and rectifier networks. CoRR Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit
2015	J	`jnl`	Hankel Matrices for the Period-Doubling Sequence. CoRR Robbert J. Fokkink, Cor Kraaikamp, Jeffrey O. Shallit
2015	—	`conf`	Mechanical Proofs of Properties of the Tribonacci Word. WORDS Hamoon Mousavi, Jeffrey O. Shallit
2015	J	`jnl`	On the Combinatorics of Palindromes and Antipalindromes. CoRR Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
2015	J	`jnl`	Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. Int. J. Found. Comput. Sci. Chen Fei Du, Jeffrey O. Shallit, Arseny M. Shur
2015	J	`jnl`	Periods and borders of random words. CoRR Stepan Holub, Jeffrey O. Shallit
2014	J	`jnl`	Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
2014	J	`jnl`	Counting the Palstars. Electron. J. Comb. L. Bruce Richmond, Jeffrey O. Shallit
2014	J	`jnl`	Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. CoRR Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit
2014	J	`jnl`	Mechanical Proofs of Properties of the Tribonacci Word. CoRR Hamoon Mousavi, Jeffrey O. Shallit
2014	J	`jnl`	Notes and Note-Pairs in Noergaard's Infinity Series. CoRR Christopher Drexler-Lemire, Jeffrey O. Shallit
2014	J	`jnl`	Reviewing the Early Days of Computing [Book Review]. Comput. Sci. Eng. Jeffrey O. Shallit
2014	—	`conf`	Similarity density of the Thue-Morse word with overlap-free infinite binary words. AFL Chen Fei Du, Jeffrey O. Shallit
2013	J	`jnl`	Automatic Theorem-Proving in Combinatorics on Words. Int. J. Found. Comput. Sci. Daniel Goc, Dane Henshall, Jeffrey O. Shallit
2013	J	`jnl`	Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2013	J	`jnl`	Counting Palstars. CoRR Jeffrey O. Shallit
2013	J	`jnl`	Counting Sequences with Small Discrepancies. Exp. Math. Alexander Leong, Jeffrey O. Shallit
2013	Misc	`conf`	Decidability and Enumeration for Automatic Sequences: A Survey. CSR Jeffrey O. Shallit
2013	—	`ch.`	Description of Generalized Continued Fractions by Finite Automata. Number Theory and Related Fields Jeffrey O. Shallit
2013	J	`jnl`	Filtrations of Formal Languages by Arithmetic Progressions. Fundam. Informaticae Hamoon Mousavi, Jeffrey O. Shallit
2013	C	`conf`	On the Number of Unbordered Factors. LATA Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit
2013	C	`conf`	Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA Daniel Goc, Kalle Saari, Jeffrey O. Shallit
2013	J	`jnl`	Remarks on Privileged Words. CoRR Michael Forsyth, Amlesh Jayakumar, Jeffrey O. Shallit
2013	C	`conf`	Repetition Avoidance in Circular Factors. Developments in Language Theory Hamoon Mousavi, Jeffrey O. Shallit
2013	J	`jnl`	Review of computability and complexity theory by Steven Homer and Alan L. Selman. SIGACT News Jeffrey O. Shallit
2013	J	`jnl`	Sets Represented as the Length-n Factors of a Word CoRR Shuo Tan, Jeffrey O. Shallit
2013	—	`conf`	Sets Represented as the Length-n Factors of a Word. WORDS Shuo Tan, Jeffrey O. Shallit
2013	J	`jnl`	Shortest Repetition-Free Words Accepted by Automata CoRR Hamoon Mousavi, Jeffrey O. Shallit
2013	—	`conf`	Shortest Repetition-Free Words Accepted by Automata. DCFS Hamoon Mousavi, Jeffrey O. Shallit
2013	C	`conf`	Subword Complexity and k-Synchronization. Developments in Language Theory Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit
2012	J	`jnl`	Automatic Theorem-Proving in Combinatorics on Words CoRR Dane Henshall, Jeffrey O. Shallit
2012	C	`conf`	Automatic Theorem-Proving in Combinatorics on Words. CIAA Daniel Goc, Dane Henshall, Jeffrey O. Shallit
2012	J	`jnl`	Avoiding 3/2-powers over the natural numbers. Discret. Math. Eric Rowland, Jeffrey O. Shallit
2012	J	`jnl`	Enumerating regular expressions and their languages CoRR Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit
2012	J	`jnl`	Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2012	J	`jnl`	Least periods of k-automatic sequences CoRR Daniel Goc, Jeffrey O. Shallit
2012	J	`jnl`	On the Number of Unbordered Factors CoRR Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit
2012	J	`jnl`	Primitive Words and Lyndon Words in Automatic Sequences CoRR Daniel Goc, Jeffrey O. Shallit
2012	J	`jnl`	Repetition Avoidance in Circular Factors CoRR Hamoon Mousavi, Jeffrey O. Shallit
2012	J	`jnl`	Review of biscuits of number theory by Arthur T. Benjamin and Ezra Brown. SIGACT News Jeffrey O. Shallit
2012	J	`jnl`	Review of finite fields and applications by Gary L. Mullen and Carl Mummert. SIGACT News Jeffrey O. Shallit
2012	J	`jnl`	Shuffling and Unshuffling. Bull. EATCS Dane Henshall, Narad Rampersad, Jeffrey O. Shallit
2012	J	`jnl`	Sturmian graphs and integer representations over numeration systems. Discret. Appl. Math. Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit
2012	J	`jnl`	The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae Narad Rampersad, Jeffrey O. Shallit, Zhi Xu
2012	J	`jnl`	The Critical Exponent is Computable for Automatic Sequences. Int. J. Found. Comput. Sci. Luke Schaeffer, Jeffrey O. Shallit
2012	C	`conf`	The State Complexity of Star-Complement-Star. Developments in Language Theory Galina Jirásková, Jeffrey O. Shallit
2012	J	`jnl`	The Subword Complexity of k-Automatic Sequences is k-Synchronized CoRR Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit
2012	J	`jnl`	The state complexity of star-complement-star CoRR Galina Jirásková, Jeffrey O. Shallit
2012	C	`conf`	k-Automatic Sets of Rational Numbers. LATA Eric Rowland, Jeffrey O. Shallit
2011	J	`jnl`	A Pattern Sequence Approach to Stern's Sequence CoRR Michael Coons, Jeffrey O. Shallit
2011	J	`jnl`	A pattern sequence approach to Stern's sequence. Discret. Math. Michael Coons, Jeffrey O. Shallit
2011	J	`jnl`	A variant of Hofstadter's sequence and finite automata CoRR Jean-Paul Allouche, Jeffrey O. Shallit
2011	J	`jnl`	Avoiding Three Consecutive Blocks of the Same Size and Same Sum CoRR Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit
2011	J	`jnl`	Closures in Formal Languages and Kuratowski's Theorem. Int. J. Found. Comput. Sci. Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit
2011	J	`jnl`	Decidability and Shortest Strings in Formal Languages CoRR Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit
2011	—	`conf`	Decidability and Shortest Strings in Formal Languages. DCFS Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit
2011	J	`jnl`	Decision problems for convex languages. Inf. Comput. Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu
2011	J	`jnl`	Enumeration and Decidable Properties of Automatic Sequences CoRR Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2011	C	`conf`	Enumeration and Decidable Properties of Automatic Sequences. Developments in Language Theory Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit
2011	J	`jnl`	Fife's Theorem Revisited CoRR Jeffrey O. Shallit
2011	C	`conf`	Fife's Theorem Revisited. Developments in Language Theory Jeffrey O. Shallit
2011	—	`conf`	Fife's Theorem for (7/3)-Powers WORDS Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur
2011	J	`jnl`	Filtrations of Formal Languages by Arithmetic Progressions CoRR Hamoon Mousavi, Jeffrey O. Shallit
2011	J	`jnl`	Finite Orbits of Language Operations CoRR Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2011	C	`conf`	Finite Orbits of Language Operations. LATA Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2011	J	`jnl`	Information theory, evolutionary computation, and Dembski's "complex specified information". Synth. Wesley R. Elsberry, Jeffrey O. Shallit
2011	J	`jnl`	Inverse star, borders, and palstars. Inf. Process. Lett. Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2011	—	`conf`	Remarks on Separating Words. DCFS Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson
2011	J	`jnl`	Remarks on separating words CoRR Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson
2011	J	`jnl`	Shuffling and Unshuffling CoRR Narad Rampersad, Jeffrey O. Shallit
2011	—	`conf`	The Critical Exponent is Computable for Automatic Sequences WORDS Jeffrey O. Shallit
2011	J	`jnl`	Unbounded Discrepancy in Frobenius Numbers. Integers Jeffrey O. Shallit, James Stankewicz
2011	J	`jnl`	Van der Waerden's Theorem and Avoidability in Words. Integers Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit
2011	J	`jnl`	k-Automatic sets of rational numbers CoRR Eric Rowland, Jeffrey O. Shallit
2010	J	`jnl`	Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003. SIGACT News Jeffrey O. Shallit
2010	J	`jnl`	Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. Narad Rampersad, Jeffrey O. Shallit
2010	J	`jnl`	Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2010	J	`jnl`	Inverse Star, Borders, and Palstars CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2010	C	`conf`	On Lazy Representations and Sturmian Graphs. CIAA Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey O. Shallit
2009	J	`jnl`	Automata and Reduced Words in the Free Group CoRR Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	Avoiding Squares and Overlaps Over the Natural Numbers. CoRR Mathieu Guay-Paquet, Jeffrey O. Shallit
2009	J	`jnl`	Avoiding squares and overlaps over the natural numbers. Discret. Math. Mathieu Guay-Paquet, Jeffrey O. Shallit
2009	J	`jnl`	Closures in Formal Languages and Kuratowski's Theorem CoRR Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit
2009	C	`conf`	Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit
2009	J	`jnl`	Closures in Formal Languages: Concatenation, Separation, and Algorithms CoRR Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit
2009	J	`jnl`	Counting Abelian Squares. Electron. J. Comb. L. Bruce Richmond, Jeffrey O. Shallit
2009	J	`jnl`	Decimations of languages and state complexity. Theor. Comput. Sci. Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit
2009	C	`conf`	Decision Problems for Convex Languages. LATA Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu
2009	J	`jnl`	Detecting palindromes, patterns and borders in regular languages. Inf. Comput. Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2009	J	`jnl`	Detecting patterns in finite regular and context-free languages CoRR Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	Efficient enumeration of words in regular languages. Theor. Comput. Sci. Margareta Ackerman, Jeffrey O. Shallit
2009	J	`jnl`	Hamming distance for conjugates. Discret. Math. Jeffrey O. Shallit
2009	J	`jnl`	Length of the Shortest Word in the Intersection of Regular Languages CoRR Thomas Ang, Jeffrey O. Shallit
2009	J	`jnl`	On NFAs where all states are final, initial, or both. Theor. Comput. Sci. Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2009	J	`jnl`	State complexity of unique rational operations. Theor. Comput. Sci. Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit, Bala Ravikumar
2009	J	`jnl`	The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages CoRR Narad Rampersad, Jeffrey O. Shallit, Zhi Xu
2008	—	`book`	A Second Course in Formal Languages and Automata Theory. Jeffrey O. Shallit
2008	J	`jnl`	An NP-hardness Result on the Monoid Frobenius Problem CoRR Zhi Xu, Jeffrey O. Shallit
2008	J	`jnl`	Avoiding Approximate Squares. Int. J. Found. Comput. Sci. Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. CoRR Elyot Grant, Jeffrey O. Shallit, Thomas Stoll
2008	J	`jnl`	Decision Problems For Convex Languages CoRR Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu
2008	C	`conf`	Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2008	C	`conf`	Finite Automata, Palindromes, Powers, and Patterns. LATA Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2008	J	`jnl`	Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation. CoRR Yann Bugeaud, Dalia Krieger, Jeffrey O. Shallit
2008	J	`jnl`	On NFAs Where All States are Final, Initial, or Both CoRR Jui-Yi Kao, Andrew J. Malton, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	Periodicity, repetitions, and orbits of an automatic sequence CoRR Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit
2008	C	`conf`	The Frobenius Problem and Its Generalizations. Developments in Language Theory Jeffrey O. Shallit
2008	A	`conf`	The Frobenius Problem in a Free Monoid. STACS Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu
2008	J	`jnl`	Van der Waerden's Theorem and Avoidability in Words. CoRR Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit
2008	J	`jnl`	Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit, Manuel Silva
2007	C	`conf`	Avoiding Approximate Squares. Developments in Language Theory Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2007	C	`conf`	Efficient Enumeration of Regular Languages. CIAA Margareta Ackerman, Jeffrey O. Shallit
2007	J	`jnl`	Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit
2007	J	`jnl`	Every real number greater than 1 is a critical exponent. Theor. Comput. Sci. Dalia Krieger, Jeffrey O. Shallit
2007	J	`jnl`	Finding the growth rate of a regular language in polynomial time CoRR Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2007	J	`jnl`	Finite automata, palindromes, patterns, and borders CoRR Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit
2007	J	`jnl`	On Sturmian graphs. Discret. Appl. Math. Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini
2007	J	`jnl`	The Frobenius Problem in a Free Monoid CoRR Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu
2006	J	`jnl`	Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. James D. Currie, Narad Rampersad, Jeffrey O. Shallit
2006	—	`conf`	New Directions in State Complexity. DCFS Jeffrey O. Shallit
2006	J	`jnl`	Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Theor. Informatics Appl. Shandy Brown, Narad Rampersad, Jeffrey O. Shallit, Troy Vasiga
2005	J	`jnl`	A generalization of repetition threshold. Theor. Comput. Sci. Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit
2005	J	`jnl`	Avoiding large squares in infinite binary words. Theor. Comput. Sci. Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2005	—	`conf`	Enumeration of Context-Free Languages and Related Structures. DCFS Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit
2005	J	`jnl`	Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang
2005	J	`jnl`	Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang
2005	J	`jnl`	Self-generating sets, integers with missing blocks, and substitutions. Discret. Math. Jean-Paul Allouche, Jeffrey O. Shallit, Guentcho Skordev
2005	J	`jnl`	State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. Bryan Krawetz, John Lawrence, Jeffrey O. Shallit
2004	B	`conf`	A Generalization of Repetition Threshold. MFCS Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit
2004	C	`conf`	Enumerating Regular Expressions and Their Languages. CIAA Jonathan Lee, Jeffrey O. Shallit
2004	—	`conf`	Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang
2004	J	`jnl`	On the iteration of certain quadratic maps over GF( Discret. Math. Troy Vasiga, Jeffrey O. Shallit
2004	J	`jnl`	Polynomial versus exponential growth in repetition-free binary words. J. Comb. Theory A Juhani Karhumäki, Jeffrey O. Shallit
2004	J	`jnl`	Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang
2004	J	`jnl`	Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. Int. J. Found. Comput. Sci. Jeffrey O. Shallit
2004	C	`conf`	State Complexity and the Monoid of Transformations of a Finite Set. CIAA Bryan Krawetz, John Lawrence, Jeffrey O. Shallit
2004	C	`conf`	Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory Chiara Epifanio, Filippo Mignosi, Jeffrey O. Shallit, Ilaria Venturini
2003	J	`jnl`	A Generalization of Repetition Threshold CoRR Lucian Ilie, Jeffrey O. Shallit
2003	—	`book`	Automatic Sequences - Theory, Applications, Generalizations. Jean-Paul Allouche, Jeffrey O. Shallit
2003	J	`jnl`	Avoiding large squares in infinite binary words CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2003	J	`jnl`	Cubefree binary words avoiding long squares CoRR Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang
2003	J	`jnl`	Periodicity, morphisms, and matrices. Theor. Comput. Sci. Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani
2003	J	`jnl`	Polynomial versus Exponential Growth in Repetition-Free Binary Words CoRR Juhani Karhumäki, Jeffrey O. Shallit
2003	J	`jnl`	Simultaneous avoidance of large squares and fractional powers in infinite binary words CoRR Jeffrey O. Shallit
2003	J	`jnl`	The ring of k-regular sequences, II. Theor. Comput. Sci. Jean-Paul Allouche, Jeffrey O. Shallit
2002	J	`jnl`	On the Number of Distinct Languages Accepted by Finite Automata with n States. J. Autom. Lang. Comb. Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit
2002	J	`jnl`	On two-sided infinite fixed points of morphisms. Theor. Comput. Sci. Jeffrey O. Shallit, Ming-wei Wang
2002	—	`conf`	Regular Expressions: New Results and Open Problems. DCFS Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang
2002	J	`jnl`	Simulating finite automata with context-free grammars. Inf. Process. Lett. Michael Domaratzki, Giovanni Pighizzini, Jeffrey O. Shallit
2002	J	`jnl`	The Cycles of the Multiway Perfect Shuffle Permutation. Discret. Math. Theor. Comput. Sci. John A. Ellis, Hongbing Fan, Jeffrey O. Shallit
2002	J	`jnl`	The computational complexity of the local postage stamp problem. SIGACT News Jeffrey O. Shallit
2002	J	`jnl`	Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. Giovanni Pighizzini, Jeffrey O. Shallit, Ming-wei Wang
2002	J	`jnl`	Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. Giovanni Pighizzini, Jeffrey O. Shallit
2001	J	`jnl`	Automatic Complexity of Strings. J. Autom. Lang. Comb. Jeffrey O. Shallit, Ming-wei Wang
2001	C	`conf`	Minimal Covers of Formal Languages. Developments in Language Theory Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu
2001	—	`conf`	On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit
2001	J	`jnl`	The computational complexity of the local postage stamp problem CoRR Jeffrey O. Shallit
2001	B	`conf`	Variations on a Theorem of Fine & Wilf. MFCS Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang
2001	J	`jnl`	Weakly Self-Avoiding Words and a Construction of Friedman. Electron. J. Comb. Jeffrey O. Shallit, Ming-wei Wang
2000	J	`jnl`	A Recurrence Generating Multiples of Primes: 10655. Am. Math. Mon. Mihály Bencze, Dan Saracino, Allen Stenger, S. Amghibech, Jean Anglesio, R. Bauer, A. Siegel, David M. Bloom, G. L. Body, David Callan, Robin J. Chapman, Kevin Ford, Stephen M. Gagola Jr., N. Gauthier, W. V. Grounds, T. Hagedorn, R. T. Koether, N. Komanda, R. N. Krishnan, K.-W. Lau, John H. Lindsey II, L. E. Mattics, C. A. Minh, H. N. Ozsoylev, C. Y. Yildirim, P. G. Poonacha, N. R. Sanjeev, C. Popescu, J. Robertson, H.-J. Sieffert, Jeffrey O. Shallit, N. C. Singer, Albert Stadler, D. C. Terr, T. V. Triff, T. Trimble, Pavel Trojovský
2000	J	`jnl`	Automaticity and Rationality. J. Autom. Lang. Comb. Jeffrey O. Shallit
2000	—	`conf`	Formal languages and number theory. Unusual Applications of Number Theory Jeffrey O. Shallit
2000	C	`conf`	State Complexity and Jacobsthal's Function. CIAA Jeffrey O. Shallit
2000	J	`jnl`	Sums of Digits, Overlaps, and Palindromes. Discret. Math. Theor. Comput. Sci. Jean-Paul Allouche, Jeffrey O. Shallit
1999	A*	`conf`	An Efficient Algorithm for Computing the SODA Jeffrey O. Shallit, David Swart
1999	C	`conf`	New problems of pattern avoidance. Developments in Language Theory John Loftus, Jeffrey O. Shallit, Ming-wei Wang
1999	—	`ch.`	Number Theory. Handbook of Discrete and Combinatorial Mathematics Jon Grantham, Carl Pomerance, Bart Goddard, Jeffrey O. Shallit
1999	B	`conf`	On Two-Sided Infinite Fixed Points of Morphisms. FCT Jeffrey O. Shallit, Ming-wei Wang
1999	J	`jnl`	Separating Words with Small Grammars. J. Autom. Lang. Comb. James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit
1999	J	`jnl`	The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1998	J	`jnl`	Automaticity III: Polynomial Automaticity and Context-Free Languages. Comput. Complex. Ian Glaister, Jeffrey O. Shallit
1998	J	`jnl`	Extremal Infinite Overlap-Free Binary Words. Electron. J. Comb. Jean-Paul Allouche, James D. Currie, Jeffrey O. Shallit
1998	J	`jnl`	Generalized Perturbed Symmetry. Eur. J. Comb. Jean-Paul Allouche, Jeffrey O. Shallit
1998	J	`jnl`	On Minimal Words With Given Subword Complexity. Electron. J. Comb. Ming-wei Wang, Jeffrey O. Shallit
1998	C	`conf`	The Ubiquitous Prouhet-Thue-Morse Sequence. SETA Jean-Paul Allouche, Jeffrey O. Shallit
1997	J	`jnl`	Automatic Maps in Exotic Numeration System. Theory Comput. Syst. Jean-Paul Allouche, Emmanuel Cateland, William J. Gilbert, Heinz-Otto Peitgen, Jeffrey O. Shallit, Guentcho Skordev
1997	J	`jnl`	Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. Carl Pomerance, John Michael Robson, Jeffrey O. Shallit
1997	J	`jnl`	Social Issues in Canada's Information Society. Inf. Soc. Jeffrey O. Shallit, Harriet Lyons
1997	J	`jnl`	The Computational Complexity of Some Problems of Linear Algebra Electron. Colloquium Comput. Complex. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1997	A	`conf`	The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1996	J	`jnl`	A Lower Bound Technique for the Size of Nondeterministic Finite Automata. Inf. Process. Lett. Ian Glaister, Jeffrey O. Shallit
1996	J	`jnl`	Automaticity I: Properties of a Measure of Descriptional Complexity. J. Comput. Syst. Sci. Jeffrey O. Shallit, Yuri Breitbart
1996	J	`jnl`	On the Vector Space of the Automatic Reals. Theor. Comput. Sci. Siegfried Lehr, Jeffrey O. Shallit, John Tromp
1996	B	`conf`	Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). MFCS Ian Glaister, Jeffrey O. Shallit
1996	J	`jnl`	Results and estimates on pseudopowers. Math. Comput. Eric Bach, Richard F. Lukes, Jeffrey O. Shallit, Hugh C. Williams
1995	J	`jnl`	Subword Complexity of a Generalized Thue-Morse Word. Inf. Process. Lett. John Tromp, Jeffrey O. Shallit
1994	J	`jnl`	A Minimization Problem. SIAM Rev. Jeffrey O. Shallit
1994	J	`jnl`	Analysis of a Left-Shift Binary GCD Algorithm. J. Symb. Comput. Jeffrey O. Shallit, Jonathan P. Sorenson
1994	—	`conf`	Analysis of a left-shift binary GCD algorithm. ANTS Jeffrey O. Shallit, Jonathan P. Sorenson
1994	A	`conf`	Automaticity: Properties of a Measure of Descriptional Complexity. STACS Jeffrey O. Shallit, Yuri Breitbart
1994	J	`jnl`	Numeration Systems, Linear Recurrences, and Regular Sets Inf. Comput. Jeffrey O. Shallit
1994	J	`jnl`	on Sparse Languages L such that LL = Sigma. Discret. Appl. Math. Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu
1993	J	`jnl`	A binary algorithm for the Jacobi symbol. SIGSAM Bull. Jeffrey O. Shallit, Jonathan Sorenson
1993	J	`jnl`	Factor Refinement. J. Algorithms Eric Bach, James R. Driscoll, Jeffrey O. Shallit
1993	J	`jnl`	On the maximum number of distinct factors of a binary string. Graphs Comb. Jeffrey O. Shallit
1992	B	`conf`	Characterizing Regular Languages with Polynomial Densities. MFCS Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey O. Shallit
1992	A*	`conf`	Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). ICALP Jeffrey O. Shallit
1992	J	`jnl`	Pattern Spectra, Substring Enumeration, and Automatic Sequences. Theor. Comput. Sci. Jean-Paul Allouche, Patrick Morton, Jeffrey O. Shallit
1992	J	`jnl`	Randomized algorithms in "primitive" cultures or what is the oracle complexity of a dead chicken? SIGACT News Jeffrey O. Shallit
1992	J	`jnl`	The "3x + 1" Problem and Finite Automata. Bull. EATCS Jeffrey O. Shallit, David A. Wilson
1992	J	`jnl`	The Ring of k-Regular Sequences. Theor. Comput. Sci. Jean-Paul Allouche, Jeffrey O. Shallit
1990	A*	`conf`	Factor Refinement. SODA Eric Bach, James R. Driscoll, Jeffrey O. Shallit
1990	J	`jnl`	On the Worst Case of Three Algorithms for Computing the Jacobi Symbol. J. Symb. Comput. Jeffrey O. Shallit
1990	A	`conf`	The Ring of k-Regular Sequences. STACS Jean-Paul Allouche, Jeffrey O. Shallit
1989	A	`conf`	A Generalization of Automatic Sequences. STACS Jeffrey O. Shallit
1989	J	`jnl`	Analysis of an Infinite Product Algorithm. SIAM J. Discret. Math. Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit
1989	J	`jnl`	Sur Des Points Fixes De Morphismes D'Un Monoïde Libre. RAIRO Theor. Informatics Appl. Jean-Paul Allouche, J. Bétréma, Jeffrey O. Shallit
1989	J	`jnl`	Two methods for generating fractals. Comput. Graph. Jeffrey O. Shallit, Jorge Stolfi
1989	J	`jnl`	Wire bending. J. Comb. Theory A Michel Mendès France, Jeffrey O. Shallit
1988	J	`jnl`	A Generalization of Automatic Sequences. Theor. Comput. Sci. Jeffrey O. Shallit
1988	J	`jnl`	A Subset Coloring Algorithm and Its Applications to Computer Graphics. Commun. ACM David Rubinstein, Jeffrey O. Shallit, Mario Szegedy
1988	J	`jnl`	Fractals, bitmaps, and APL. ACM SIGAPL APL Quote Quad Jeffrey O. Shallit
1986	J	`jnl`	Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. Eric Bach, Gary L. Miller, Jeffrey O. Shallit
1985	A*	`conf`	Factoring with Cyclotomic Polynomials FOCS Eric Bach, Jeffrey O. Shallit
1985	J	`jnl`	Number-Theoretic Functions Which Are Equivalent to Number of Divisors. Inf. Process. Lett. Jeffrey O. Shallit, Adi Shamir
1984	A*	`conf`	Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) STOC Eric Bach, Gary L. Miller, Jeffrey O. Shallit
1983	—	`conf`	Merrily we roll along: Some aspects of? APL Jeffrey O. Shallit
1982	—	`conf`	Computational simplicial homology in APL. APL Jeffrey O. Shallit
1981	—	`conf`	Infinite arrays and diagonalization. APL Jeffrey O. Shallit
1976	J	`jnl`	The prime factorization of 1. ACM SIGAPL APL Quote Quad Jeffrey O. Shallit