Search
Now showing items 51-60 of 73
Mathematical Concepts and Proofs from Nicole Oresme: Using the History of Calculus to Teach Mathematics
(2005)
This paper examines the mathematical work of the French bishop, Nicole Oresme (c. 1323–1382), and his contributions towards the development of the concept of graphing functions and approaches to investigating infinite ...
Multi-dimensional sets recognizable in all abstract numeration systems
(EDP Sciences, 2011)
We prove that the subsets of Nd that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.
Avoidability index for binary patterns with reversal
(2017)
For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.
A direct proof of a result of Thue
(Utilitas Mathematica, 1984)
Sliding Down Inclines with Fixed Descent Time: a Converse to Galileo's Law of Chords
(Canadian Mathematical Society, 2008-12)
Combinatorics and Algorithmics of Strings
(Dagstuhl Publishing, 2014-03-09)
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words ...
Generating self-complementary uniform hypergraphs
(Discrete Mathematics, 2010-02)
In 2007, Szymanski and Wojda proved that for positive integers n; k with k less than n, a self-complementary k-uniform hypergraph of order n exists if and only if n/k is even. In this paper, we characterize the cycle type ...
Automaticity of Primitive Words and Irreducible Polynomials
(Discrete Mathematics and Theoretical Computer Science, 2013)
If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all ...
Overlap-Free Words and Generalizations
(University of Winnipeg, 2007)
The study of combinatorics on words dates back at least to the beginning of the
20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains ...
This is Us: Latent Profile Analysis of Canadian Teachers’ Burnout during the COVID-19 Pandemic
(Canadian Society for the Study of Education, 2022)
During the initial wave of the COVID-19 pandemic, 1,930 Canadian teachers were surveyed about their burnout and resilience levels, as well as their job demands and resources. Latent profile analysis revealed that teachers ...