PUBLICATIONS
   L.J. Cummings, Overlaps in Binary Systematic Codes, 
   Congressus Numerantium 171(2004), 33-39.

   L.J. Cummings, Divisibility Exponents and the Zimin Recursion, 
   Congressus Numerantium 163(2003), 57-64.    
   
   L.J. Cummings, Hankel Matrices in Combinatorial Analysis, 
   Congressus Numerantium 146(2000), 57-63.
  
   L.J. Cummings, Comma-free Bipartite Subgraphs of the De Bruijn Graph,
   The Journal of Combinatorial Mathematics and Combinatorial Computing,
   42(2002), 161-166.

   L.J. Cummings, Connected Components of Comma-free Codes, 
   Congressus Numerantium 151(2001), 179-187.
  
   L.J. Cummings and M. Mays, A one-sided Zimin construction, 
   Electronic Journal of Combinatorics, 8(1)(2001), R27.
 
   L.J. Cummings, Combinatorial Structures in the de Bruijn Graph,
   The Journal of Combinatorial Mathematics and Combinatorial Computing,
   28(1998), 95-100.

   L.J. Cummings and W. F. Smyth, Weak repetitions in strings, 
   The Journal of Combinatorial Mathematics and Combinatorial Computing, 
   24(1997), 259-266.

   L.J. Cummings, Abelian Squares in Finite Strings, 
   The Journal of Combinatorial Mathematics and Combinatorial Computing,
   24(1997), 201-208. 

   L.J. Cummings, Strongly Square-Free Strings on Three Letters, 
   The Australasian Journal of Combinatorics 14(1996), 259-266.

   L.J. Cummings, J. Karhumaki, and D. Moore, Borders of Fibonacci Strings, 
   The Journal of Combinatorial Mathematics and Combinatorial Computing, 
   20(1996), 81-87.

   L.J. Cummings, Gray Codes and Strongly Square-Free Strings,  
   R. Capocelli, A. de Santis, U. Vacaro, eds., Sequences II, Springer- Verlag,
   1993.

   L.J. Cummings and L.B. Beasley, The structure of generalized permutation 
   semigroups, Linear Algebra and its Applications, 184 1993, 235-247.

   L.J. Cummings and L.B. Beasley,  Multiplicativity of generalized permanents 
   over semirings, in  Graphs, Matrices, and Designs; Festschrift in honour of 
   N.J. Pullman, Marcel Dekker, 1993, 121-131.

   L.J. Cummings and M.E. Mays, Shuffled Lyndon Words,
   Ars Combinatoria 33(1992), 47-56.

   L.J. Cummings, Gray arrays and Gray tori, 
   Journal of Combinatorial Theory, Series A. 59(1992), 177-186.

   L.J. Cummings and L.B. Beasley, Schur extensions of monomial matrix groups, 
   Linear Algebra and its Applications, 161(1992), 11-25.

   L.J. Cummings and M.E. Mays, On the parity of the Witt formula, 
   Congressus Numerantium, 80(1991), 49-56.

   L.J. Cummings, Sequences of Lyndon Words, in Sequences,
   Springer-Verlag, 1990, 156-165.

   L.J. Cummings, Gray paths of Lyndon words in the N-cube,
   Congressus Numerantium 69(1989), 199-206. 

   L.J. Cummings and J. Yukas,  Paths of Lyndon words,
   The Journal of Combinatorial Mathematics and Combinatorial Computing, 
   6(1989), 63-66. 

   L.J. Cummings, Connectivity of synchronizable codes in the n-cube, 
   The Journal of Combinatorial Mathematics and Combinatorial Computing, 
   3(1988), 93-96.
	
   L.J. Cummings,  A Hamilton Path Construction for Lyndon Words in the N-cube,
   Proceedings of the 5th Caribbean Conference in Combinatorics and Computing,
   University of the West Indies, Cave Hill, 1988, 33-40.

   L.J. Cummings, Aspects of Synchronizable Coding, 
   The Journal of Combinatorial Mathematics and Combinatorial Computing, 
   1(1987), 67-84.

   L.J. Cummings and D.H. Wiedemann, Embedded deBruijn Sequences, Congressus 	
   Numeratium 53(1986), pp. 155-160.

   L.B. Beasley and L.J. Cummings; Test sets for generalized matrix functions, 
   Linear and Multilinear Algebra 17(1985), 301-307.

   L.J. Cummings; Synchronizable Codes in the De Bruijn graph, 
   Ars Combinatoria 19 (1985), 73-80.

   L.J. Cummings; Matrix problems in synchronizable coding, 
   Linear Algebra and its  Applications, 59 (1984), 186-188.

   L.J. Cummings; Comma-free codes in the De Bruijn graph, 
   Caribbean Journal of Mathematics 2 (1984), 65-68.

   L.J. Cummings, Ed., "Combinatorics on Words, Progress and Perspectives", 
   Academic Press, Inc. New York, 1983.

   L.B.Beasley and L.J. Cummings; On the uniqueness of generalized matrix 
   functions, Proc. Amer. Math. Soc. 87 (1983), 229-232.

   L.J. Cummings; Strongly qth power-free strings, 
   Proceedings for the Colloque International sur la Theorie des Graphes 
   et Combinatore, North Holland, 1983, 247-252.

   L.J. Cummings and B.C. de Gopi; Maximal incidence algebras, 
   Ars Combinatoria, 13 (1982), 145-147.

   L.B. Beasley and L. Cummings; Multiplicative properties of generalized matrix functions, 	
   Linear and Multilinear Algebra 11 (1982), 23-31.

   L.J. Cummings; Overlapping Substrings and Thue's Problem,
   Proceedings of the Third Caribbean Conference in Combinatorics and Computing,
   University of the West Indies, Barbados, (1981), 99-109.

   L.J. Cummings; On the construction of Thue sequences,
   Proceedings of the Ninth Southeastern Conference on Combinatorics, 
   Graph Theory and Computing, Florida Atlantic University, Boca Raton, 
   (1978), 235-242.

   L.B. Beasley and L. Cummings; Permanent semigroups, 
   Linear and Multilinear Algebra 5 (1978), 297-302.

   L. Cummings; Dimers, Ontario Secondary School Math. Bull. 14 (1978), 21-25.

   L.J. Cummings; Maximum comma-free codes as cosets of linear codes, 
   Ars Combinatoria, 3 (1977), 115-122.

   L.J. Cummings and J.S. Wallis; An algorithm for the permanent of circulant 
   matrices, Canadian Math. Bull., 20 (1977), 67-70.

   A. H. Ball and L. Cummings; Lower for CF (n,6) codes,
   Proceedings of the Seventh Manitoba Conference on Numerical Mathematics,
   University of Manitoba, Winnipeg, (1977), 177-190.

   L.J. Cummings and W.D. Wallis; A transversal algorithm for regular square 
   incidence matrices, Eighth Southeastern Conference on Combinatorics, 
   Graph Theory and Computing, March 1977, Louisiana State University, 213-226.

   L.J. Cummings; Are maximum synchronizable codes linear?
   Proceedings of the Second Caribbean Conference in Combinatorics and 
   Computing, University of the West Indies, Barbados, 1977, 107-114.

   L.J. Cummings and R.W. Robinson; Linear symmetry classes, 
   Canadian Journal of Mathematics, 28(1976), 1311-1319.

   A. Ball and L. Cummings; Extremal digraphs and comma-free codes, 
   Ars Combinatoria 1 (1976), 239-251.

   A. Ball and L. Cummings; The comma-free codes with words of length two, 
   Bull. Australian Math. Soc. 14 (1976), 249-258.

   L.J. Cummings; Cyclic symmetry classes, Journal of Algebra, 
   40 (1976), 401-405.

   L. Cummings; Comma-free codes and incidence algebras (invited address),
   Proceedings of the fourth Australian Conference on Combinatorical Mathematics, Adelaide 1975,
   Lecture Notes in Mathematics, Vol. 560, Springer-Verlag, Berlin (1976), 1-6.

   L. Cummings; Elementary-maximal permanent semigroups,
   Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing, March 1973,
   Florida Atlantic University, Boca Raton, (1973), 233-236.

   L.J. Cummings and D.A. Fox; Some mathematical properties of cycling strategies in citation
   indexes, Inform. Stor. Retr. 9 (1973), 713-719.

   L.B. Beasley and L. Cummings; Permanent groups II, Proc. Amer. Math. Soc. 40 (1973), 358-364.

   L.J. Cummings; Transformations of symmetric tensors, 
   Pacific J. Math. 42 (1972), 603-613.

   L.B. Beasley and L. Cummings; Permanent groups, 
   Proc. Amer. Math. Soc. 34 (1972), 351-355.

   J.L. Brenner, L. Cummings; The Hadamard maximum determinant problem, 
   Amer, Math. Monthly 79 (1972), 626-630.

   L.J. Cummings; Decomposable symmetric tensors, 
   Pacific J. Math. 35 (1970), 65-77.

   L.J. Cummings; Characteristic roots of rank 1 matrices, 
   Amer. Math. Monthly 77 (1968), 1105-1106.