Luke Schaeffer

Available identifiers

zbMath Open schaeffer.lukeMaRDI QIDQ346251

List of research outcomes

Publication	Date of Publication	Type
The first-order theory of binary overlap-free words is decidable	2024-10-22	Paper
Decidability for Sturmian words	2024-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q6124959	2024-04-10	Paper
The First-Order Theory of Binary Overlap-Free Words is Decidable	2022-09-07	Paper
Classical algorithms for Forrelation	2021-02-13	Paper
Ostrowski-automatic sequences: theory and applications	2021-02-03	Paper
Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond	2021-01-19	Paper
String Attractors for Automatic Sequences	2020-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q5132212	2020-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q5121907	2020-09-22	Paper
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits	2020-01-30	Paper
The classification of reversible bit operations	2018-05-03	Paper
A physically universal cellular automaton	2017-05-19	Paper
Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.	2017-04-06	Paper
Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability	2016-12-05	Paper
Decision algorithms for Fibonacci-automatic words. I: Basic results.	2016-08-12	Paper
The critical exponent is computable for automatic sequences	2016-03-01	Paper
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences	2016-02-11	Paper
Game values and computational complexity: an analysis via black-white combinatorial games	2016-01-11	Paper
A new approach to the paperfolding sequences	2015-10-20	Paper
A physically universal quantum cellular automaton	2015-08-07	Paper
Avoiding three consecutive blocks of the same size and same sum	2014-09-12	Paper
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance	2014-06-03	Paper
The critical exponent is computable for automatic sequences	2013-07-30	Paper
Subword complexity and \(k\)-synchronization	2013-06-28	Paper
Ostrowski Numeration and the Local Period of Sturmian Words	2013-03-18	Paper
An Improved Lower Bound for Stack Sorting	2012-12-04	Paper
Decidability and shortest strings in formal languages	2011-07-29	Paper
Beatty Sequences for a Quadratic Irrational: Decidability and Applications	N/A	Paper

Research outcomes over time

This page was built for person: Luke Schaeffer