Luke Schaeffer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2013
c2		Luke Schaeffer: Ostrowski Numeration and the Local Period of Sturmian Words. LATA 2013: 493-503
	2012
j1		Luke Schaeffer, Jeffrey Shallit: The Critical Exponent is Computable for Automatic Sequences. Int. J. Found. Comput. Sci. 23(8): 1611-1626 (2012)
i5		Daniel Goc, Luke Schaeffer, Jeffrey Shallit: The Subword Complexity of k-Automatic Sequences is k-Synchronized. CoRR abs/1206.5352 (2012)
i4		Luke Schaeffer: Ostrowski Numeration and the Local Period of Sturmian Words. CoRR abs/1210.2343 (2012)
i3		Luke Schaeffer: An Improved Lower Bound for Stack Sorting. CoRR abs/1212.0836 (2012)
	2011
c1		Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit: Decidability and Shortest Strings in Formal Languages. DCFS 2011: 55-67
i2		Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit: Decidability and Shortest Strings in Formal Languages. CoRR abs/1103.1622 (2011)
i1		Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey Shallit: Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011)

Coauthor Index

1	Levent Alpoge	[c1] [i2]
2	Thomas Ang	[c1] [i2]
3	Julien Cassaigne	[i1]
4	James D. Currie	[i1]
5	Daniel Goc	[i5]
6	Jeffrey Shallit (Jeffrey O. Shallit)	[j1] [i5] [c1] [i2] [i1]

Last update Sat May 25 14:20:11 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page