 | 2009 |
|---|
| 113 |       | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages and Kuratowski's Theorem.
Developments in Language Theory 2009: 125-144 |
| 112 | | Janusz A. Brzozowski,
Jeffrey Shallit,
Zhi Xu:
Decision Problems for Convex Languages.
LATA 2009: 247-258 |
| 111 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages and Kuratowski's Theorem
CoRR abs/0901.3761: (2009) |
| 110 | | Janusz A. Brzozowski,
Elyot Grant,
Jeffrey Shallit:
Closures in Formal Languages: Concatenation, Separation, and Algorithms
CoRR abs/0901.3763: (2009) |
| 109 | | Narad Rampersad,
Jeffrey Shallit:
Detecting patterns in finite regular and context-free languages
CoRR abs/0906.3220: (2009) |
| 108 | | Narad Rampersad,
Jeffrey Shallit,
Z. Xu:
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
CoRR abs/0907.0159: (2009) |
| 107 | | Thomas Ang,
Jeffrey Shallit:
Length of the Shortest Word in the Intersection of Regular Languages
CoRR abs/0910.1528: (2009) |
| 106 | | Thomas Ang,
Giovanni Pighizzini,
Narad Rampersad,
Jeffrey Shallit:
Automata and Reduced Words in the Free Group
CoRR abs/0910.4555: (2009) |
| 105 | | Terry Anderson,
John Loftus,
Narad Rampersad,
Nicolae Santean,
Jeffrey Shallit:
Detecting palindromes, patterns and borders in regular languages.
Inf. Comput. 207(11): 1096-1118 (2009) |
| 104 | | Dalia Krieger,
Avery Miller,
Narad Rampersad,
Bala Ravikumar,
Jeffrey Shallit:
Decimations of languages and state complexity.
Theor. Comput. Sci. 410(24-25): 2401-2409 (2009) |
| 103 | | Narad Rampersad,
Nicolae Santean,
Jeffrey Shallit,
Bala Ravikumar:
State complexity of unique rational operations.
Theor. Comput. Sci. 410(24-25): 2431-2441 (2009) |
| 102 | | Jean-Paul Allouche,
Narad Rampersad,
Jeffrey Shallit:
Periodicity, repetitions, and orbits of an automatic sequence.
Theor. Comput. Sci. 410(30-32): 2795-2803 (2009) |
| 101 | | Margareta Ackerman,
Jeffrey Shallit:
Efficient enumeration of words in regular languages.
Theor. Comput. Sci. 410(37): 3461-3470 (2009) |
| 2008 |
|---|
| 100 | | Pawel Gawrychowski,
Dalia Krieger,
Narad Rampersad,
Jeffrey Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.
Developments in Language Theory 2008: 339-358 |
| 99 | | Jeffrey Shallit:
The Frobenius Problem and Its Generalizations.
Developments in Language Theory 2008: 72-83 |
| 98 | | Terry Anderson,
Narad Rampersad,
Nicolae Santean,
Jeffrey Shallit:
Finite Automata, Palindromes, Powers, and Patterns.
LATA 2008: 52-63 |
| 97 | | Jui-Yi Kao,
Jeffrey Shallit,
Zhi Xu:
The Frobenius Problem in a Free Monoid.
STACS 2008: 421-432 |
| 96 | | Zhi Xu,
Jeffrey Shallit:
An NP-hardness Result on the Monoid Frobenius Problem
CoRR abs/0805.4049: (2008) |
| 95 | | Jean-Paul Allouche,
Narad Rampersad,
Jeffrey Shallit:
Periodicity, repetitions, and orbits of an automatic sequence
CoRR abs/0808.1657: (2008) |
| 94 | | Janusz A. Brzozowski,
Jeffrey Shallit,
Zhi Xu:
Decision Problems For Convex Languages
CoRR abs/0808.1928: (2008) |
| 93 | | Jui-Yi Kao,
Andrew J. Malton,
Narad Rampersad,
Jeffrey Shallit:
On NFAs Where All States are Final, Initial, or Both
CoRR abs/0808.2417: (2008) |
| 92 | | Pascal Ochem,
Narad Rampersad,
Jeffrey Shallit:
Avoiding Approximate Squares.
Int. J. Found. Comput. Sci. 19(3): 633-648 (2008) |
| 91 | | Jui-Yi Kao,
Narad Rampersad,
Jeffrey Shallit,
Manuel Silva:
Words avoiding repetitions in arithmetic progressions.
Theor. Comput. Sci. 391(1-2): 126-137 (2008) |
| 2007 |
|---|
| 90 | | Margareta Ackerman,
Jeffrey Shallit:
Efficient Enumeration of Regular Languages.
CIAA 2007: 226-242 |
| 89 | | Dalia Krieger,
Pascal Ochem,
Narad Rampersad,
Jeffrey Shallit:
Avoiding Approximate Squares.
Developments in Language Theory 2007: 278-289 |
| 88 | | Jui-Yi Kao,
Jeffrey Shallit,
Zhi Xu:
The Frobenius Problem in a Free Monoid
CoRR abs/0708.3224: (2007) |
| 87 | | Terry Anderson,
Narad Rampersad,
Nicolae Santean,
Jeffrey Shallit:
Finite automata, palindromes, patterns, and borders
CoRR abs/0711.3183: (2007) |
| 86 | | Dalia Krieger,
Narad Rampersad,
Jeffrey Shallit:
Finding the growth rate of a regular language in polynomial time
CoRR abs/0711.4990: (2007) |
| 85 | | Chiara Epifanio,
Filippo Mignosi,
Jeffrey Shallit,
Ilaria Venturini:
On Sturmian graphs.
Discrete Applied Mathematics 155(8): 1014-1030 (2007) |
| 84 |  | Michael Domaratzki,
Alexander Okhotin,
Jeffrey Shallit:
Enumeration of Context-Free Languages and Related Structures.
Journal of Automata, Languages and Combinatorics 12(1-2): 79-95 (2007) |
| 83 | | Dalia Krieger,
Jeffrey Shallit:
Every real number greater than 1 is a critical exponent.
Theor. Comput. Sci. 381(1-3): 177-182 (2007) |
| 2006 |
|---|
| 82 | | James D. Currie,
Narad Rampersad,
Jeffrey Shallit:
Binary Words Containing Infinitely Many Overlaps.
Electr. J. Comb. 13(1): (2006) |
| 81 | | Shandy Brown,
Narad Rampersad,
Jeffrey Shallit,
Troy Vasiga:
Squares and overlaps in the Thue-Morse sequence and some variants.
ITA 40(3): 473-484 (2006) |
| 2005 |
|---|
| 80 | | Jean-Paul Allouche,
Jeffrey Shallit,
Guentcho Skordev:
Self-generating sets, integers with missing blocks, and substitutions.
Discrete Mathematics 292(1-3): 1-15 (2005) |
| 79 | | Bryan Krawetz,
John Lawrence,
Jeffrey Shallit:
State complexity and the monoid of transformations of a finite set.
Int. J. Found. Comput. Sci. 16(3): 547-563 (2005) |
| 78 | | Michael Domaratzki,
Keith Ellul,
Jeffrey Shallit,
Ming-wei Wang:
Non-uniqueness and radius of cyclic unary NFAs.
Int. J. Found. Comput. Sci. 16(5): 883-896 (2005) |
| 77 | | Keith Ellul,
Bryan Krawetz,
Jeffrey Shallit,
Ming-wei Wang:
Regular Expressions: New Results and Open Problems.
Journal of Automata, Languages and Combinatorics 10(4): 407-437 (2005) |
| 76 | | Narad Rampersad,
Jeffrey Shallit,
Ming-wei Wang:
Avoiding large squares in infinite binary words.
Theor. Comput. Sci. 339(1): 19-34 (2005) |
| 75 | | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A generalization of repetition threshold.
Theor. Comput. Sci. 345(2-3): 359-369 (2005) |
| 2004 |
|---|
| 74 | | Jonathan Lee,
Jeffrey Shallit:
Enumerating Regular Expressions and Their Languages.
CIAA 2004: 2-22 |
| 73 | | Bryan Krawetz,
John Lawrence,
Jeffrey Shallit:
State Complexity and the Monoid of Transformations of a Finite Set.
CIAA 2004: 213-224 |
| 72 | | Chiara Epifanio,
Filippo Mignosi,
Jeffrey Shallit,
Ilaria Venturini:
Sturmian Graphs and a Conjecture of Moser.
Developments in Language Theory 2004: 175-187 |
| 71 | | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A Generalization of Repetition Threshold.
MFCS 2004: 818-826 |
| 70 | | Troy Vasiga,
Jeffrey Shallit:
On the iteration of certain quadratic maps over GF(p).
Discrete Mathematics 277(1-3): 219-240 (2004) |
| 69 | | Jeffrey Shallit:
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words.
Int. J. Found. Comput. Sci. 15(2): 317-327 (2004) |
| 68 | | Juhani Karhumäki,
Jeffrey Shallit:
Polynomial versus exponential growth in repetition-free binary words.
J. Comb. Theory, Ser. A 105(2): 335-347 (2004) |
| 67 | | Keith Ellul,
Bryan Krawetz,
Jeffrey Shallit,
Ming-wei Wang:
Regular Expressions: New Results and Open Problems.
Journal of Automata, Languages and Combinatorics 9(2/3): 233-256 (2004) |
| 2003 |
|---|
| 66 | | Narad Rampersad,
Jeffrey Shallit,
Ming-wei Wang:
Cubefree binary words avoiding long squares
CoRR math.CO/0302303: (2003) |
| 65 | | Juhani Karhumäki,
Jeffrey Shallit:
Polynomial versus Exponential Growth in Repetition-Free Binary Words
CoRR math.CO/0304095: (2003) |
| 64 | | Jeffrey Shallit:
Simultaneous avoidance of large squares and fractional powers in infinite binary words
CoRR math.CO/0304476: (2003) |
| 63 | | Narad Rampersad,
Jeffrey Shallit,
Ming-wei Wang:
Avoiding large squares in infinite binary words
CoRR math.CO/0306081: (2003) |
| 62 | | Lucian Ilie,
Jeffrey Shallit:
A Generalization of Repetition Threshold
CoRR math.CO/0310144: (2003) |
| 61 | | Sabin Cautis,
Filippo Mignosi,
Jeffrey Shallit,
Ming-wei Wang,
Soroosh Yazdani:
Periodicity, morphisms, and matrices.
Theor. Comput. Sci. 295: 107-121 (2003) |
| 60 | | Jean-Paul Allouche,
Jeffrey Shallit:
The ring of k-regular sequences, II.
Theor. Comput. Sci. 307(1): 3-29 (2003) |
| 2002 |
|---|
| 59 | | John A. Ellis,
Hongbing Fan,
Jeffrey Shallit:
The Cycles of the Multiway Perfect Shuffle Permutation.
Discrete Mathematics & Theoretical Computer Science 5(1): 169-180 (2002) |
| 58 | | Michael Domaratzki,
Giovanni Pighizzini,
Jeffrey Shallit:
Simulating finite automata with context-free grammars.
Inf. Process. Lett. 84(6): 339-344 (2002) |
| 57 | | Giovanni Pighizzini,
Jeffrey Shallit:
Unary Language Operations, State Complexity and Jacobsthal's Function.
Int. J. Found. Comput. Sci. 13(1): 145-159 (2002) |
| 56 | | Giovanni Pighizzini,
Jeffrey Shallit,
Ming-wei Wang:
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.
J. Comput. Syst. Sci. 65(2): 393-414 (2002) |
| 55 | | Michael Domaratzki,
Derek Kisman,
Jeffrey Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States.
Journal of Automata, Languages and Combinatorics 7(4): 469-486 (2002) |
| 54 | | Jeffrey Shallit,
Ming-wei Wang:
On two-sided infinite fixed points of morphisms.
Theor. Comput. Sci. 270(1-2): 659-675 (2002) |
| 2001 |
|---|
| 53 | | Michael Domaratzki,
Jeffrey Shallit,
Sheng Yu:
Minimal Covers of Formal Languages.
Developments in Language Theory 2001: 319-329 |
| 52 | | Filippo Mignosi,
Jeffrey Shallit,
Ming-wei Wang:
Variations on a Theorem of Fine & Wilf.
MFCS 2001: 512-523 |
| 51 | | Jeffrey Shallit:
The computational complexity of the local postage stamp problem
CoRR math.NT/0112257: (2001) |
| 50 | | Jeffrey Shallit,
Ming-wei Wang:
Weakly Self-Avoiding Words and a Construction of Friedman.
Electr. J. Comb. 8(1): (2001) |
| 49 | | Jeffrey Shallit,
Ming-wei Wang:
Automatic Complexity of Strings.
Journal of Automata, Languages and Combinatorics 6(4): 537-554 (2001) |
| 2000 |
|---|
| 48 | | Jeffrey Shallit:
State Complexity and Jacobsthal's Function.
CIAA 2000: 272-278 |
| 47 | | Jean-Paul Allouche,
Jeffrey Shallit:
Sums of Digits, Overlaps, and Palindromes.
Discrete Mathematics & Theoretical Computer Science 4(1): 1-10 (2000) |
| 46 | | Jeffrey Shallit:
Automaticity and Rationality.
Journal of Automata, Languages and Combinatorics 5(3): 255-268 (2000) |
| 1999 |
|---|
| 45 | | John Loftus,
Jeffrey Shallit,
Ming-wei Wang:
New problems of pattern avoidance.
Developments in Language Theory 1999: 185-199 |
| 44 | | Jeffrey Shallit,
Ming-wei Wang:
On Two-Sided Infinite Fixed Points of Morphisms.
FCT 1999: 488-499 |
| 43 | | Jeffrey Shallit,
David Swart:
An Efficient Algorithm for Computing the ith letter of 4na.
SODA 1999: 768-775 |
| 42 | | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra.
J. Comput. Syst. Sci. 58(3): 572-596 (1999) |
| 41 | | James D. Currie,
Holger Petersen,
John Michael Robson,
Jeffrey Shallit:
Seperating Words with Small Grammars.
Journal of Automata, Languages and Combinatorics 4(2): 101-110 (1999) |
| 1998 |
|---|
| 40 | | Ian Glaister,
Jeffrey Shallit:
Automaticity III: Polynomial Automaticity and Context-Free Languages.
Computational Complexity 7(4): 371-387 (1998) |
| 39 | | Jean-Paul Allouche,
James D. Currie,
Jeffrey Shallit:
Extremal Infinite Overlap-Free Binary Words.
Electr. J. Comb. 5: (1998) |
| 38 | | Ming-wei Wang,
Jeffrey Shallit:
On Minimal Words With Given Subword Complexity.
Electr. J. Comb. 5: (1998) |
| 37 | | Jean-Paul Allouche,
Jeffrey Shallit:
Generalized Perturbed Symmetry.
Eur. J. Comb. 19(4): 401-411 (1998) |
| 1997 |
|---|
| 36 | | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).
STACS 1997: 451-462 |
| 35 | | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra
Electronic Colloquium on Computational Complexity (ECCC) 4(9): (1997) |
| 34 | | Jeffrey Shallit,
Harriet Lyons:
Social Issues in Canada's Information Society.
Inf. Soc. 13(2): (1997) |
| 33 | | Carl Pomerance,
John Michael Robson,
Jeffrey Shallit:
Automaticity II: Descriptional Complexity in the Unary Case.
Theor. Comput. Sci. 180(1-2): 181-201 (1997) |
| 32 | | Jean-Paul Allouche,
E. Cateland,
W. J. Gilbert,
Heinz-Otto Peitgen,
Jeffrey Shallit,
Guentcho Skordev:
Automatic Maps in Exotic Numeration System.
Theory Comput. Syst. 30(3): 285-331 (1997) |
| 1996 |
|---|
| 31 | | Ian Glaister,
Jeffrey Shallit:
Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract).
MFCS 1996: 382-393 |
| 30 | | Ian Glaister,
Jeffrey Shallit:
A Lower Bound Technique for the Size of Nondeterministic Finite Automata.
Inf. Process. Lett. 59(2): 75-77 (1996) |
| 29 | | Jeffrey Shallit,
Yuri Breitbart:
Automaticity I: Properties of a Measure of Descriptional Complexity.
J. Comput. Syst. Sci. 53(1): 10-25 (1996) |
| 28 | | Eric Bach,
Richard F. Lukes,
Jeffrey Shallit,
Hugh C. Williams:
Results and estimates on pseudopowers.
Math. Comput. 65(216): 1737-1747 (1996) |
| 27 | | Siegfried Lehr,
Jeffrey Shallit,
John Tromp:
On the Vector Space of the Automatic Reals.
Theor. Comput. Sci. 163(1&2): 193-210 (1996) |
| 1995 |
|---|
| 26 | | John Tromp,
Jeffrey Shallit:
Subword Complexity of a Generalized Thue-Morse Word.
Inf. Process. Lett. 54(6): 313-316 (1995) |
| 1994 |
|---|
| 25 | | Jeffrey Shallit,
Jonathan Sorenson:
Analysis of a left-shift binary GCD algorithm.
ANTS 1994: 169-183 |
| 24 | | Jeffrey Shallit,
Yuri Breitbart:
Automaticity: Properties of a Measure of Descriptional Complexity.
STACS 1994: 619-630 |
| 23 | | Per Enflo,
Andrew Granville,
Jeffrey Shallit,
Sheng Yu:
on Sparse Languages L such that LL = Sigma.
Discrete Applied Mathematics 52(3): 275-285 (1994) |
| 22 | | Jeffrey Shallit:
Numeration Systems, Linear Recurrences, and Regular Sets
Inf. Comput. 113(2): 331-347 (1994) |
| 21 | | Jeffrey Shallit,
Jonathan Sorenson:
Analysis of a Left-Shift Binary GCD Algorithm.
J. Symb. Comput. 17(6): 473-486 (1994) |
| 1993 |
|---|
| 20 | | Eric Bach,
James R. Driscoll,
Jeffrey Shallit:
Factor Refinement.
J. Algorithms 15(2): 199-222 (1993) |
| 1992 |
|---|
| 19 | | Jeffrey Shallit:
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract).
ICALP 1992: 89-100 |
| 18 | | Andrew Szilard,
Sheng Yu,
Kaizhong Zhang,
Jeffrey Shallit:
Characterizing Regular Languages with Polynomial Densities.
MFCS 1992: 494-503 |
| 17 | | Jeffrey Shallit,
David Wilson:
The "3x + 1" Problem and Finite Automata.
Bulletin of the EATCS 46: 182-185 (1992) |
| 16 | | Jean-Paul Allouche,
Patrick Morton,
Jeffrey Shallit:
Pattern Spectra, Substring Enumeration, and Automatic Sequences.
Theor. Comput. Sci. 94(2): 161-174 (1992) |
| 15 | | Jean-Paul Allouche,
Jeffrey Shallit:
The Ring of k-Regular Sequences.
Theor. Comput. Sci. 98(2): 163-197 (1992) |
| 1990 |
|---|
| 14 | | Eric Bach,
James R. Driscoll,
Jeffrey Shallit:
Factor Refinement.
SODA 1990: 201-211 |
| 13 | | Jean-Paul Allouche,
Jeffrey Shallit:
The Ring of k-Regular Sequences.
STACS 1990: 12-23 |
| 12 | | Jeffrey Shallit:
On the Worst Case of Three Algorithms for Computing the Jacobi Symbol.
J. Symb. Comput. 10(6): 593-610 (1990) |
| 1989 |
|---|
| 11 | | Jeffrey Shallit:
A Generalization of Automatic Sequences.
STACS 1989: 156-167 |
| 10 | | Jeffrey Shallit,
Jorge Stolfi:
Two methods for generating fractals.
Computers & Graphics 13(2): 185-191 (1989) |
| 9 | | Jean-Paul Allouche,
J. Bétréma,
Jeffrey Shallit:
Sur Des Points Fixes De Morphismes D'Un Monoïde Libre.
ITA 23(3): 235-249 (1989) |
| 8 | | Michel Mendès France,
Jeffrey Shallit:
Wire bending.
J. Comb. Theory, Ser. A 50(1): 1-23 (1989) |
| 7 | | Jean-Paul Allouche,
Péter Hajnal,
Jeffrey Shallit:
Analysis of an Infinite Product Algorithm.
SIAM J. Discrete Math. 2(1): 1-15 (1989) |
| 1988 |
|---|
| 6 | | David Rubinstein,
Jeffrey Shallit,
Mario Szegedy:
A Subset Coloring Algorithm and Its Applications to Computer Graphics.
Commun. ACM 31(10): 1228-1232 (1988) |
| 5 | | Jeffrey Shallit:
A Generalization of Automatic Sequences.
Theor. Comput. Sci. 61: 1-16 (1988) |
| 1986 |
|---|
| 4 | | Eric Bach,
Gary L. Miller,
Jeffrey Shallit:
Sums of Divisors, Perfect Numbers and Factoring.
SIAM J. Comput. 15(4): 1143-1154 (1986) |
| 1985 |
|---|
| 3 | | Eric Bach,
Jeffrey Shallit:
Factoring with Cyclotomic Polynomials
FOCS 1985: 443-450 |
| 2 | | Jeffrey Shallit,
Adi Shamir:
Number-Theoretic Functions Which Are Equivalent to Number of Divisors.
Inf. Process. Lett. 20(3): 151-153 (1985) |
| 1984 |
|---|
| 1 | | Eric Bach,
Gary L. Miller,
Jeffrey Shallit:
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)
STOC 1984: 183-190 |
