Search
Now showing items 31-38 of 38
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 ...
Constructing Regular Self-complementary Uniform Hypergraphs
(Journal of Combinatorial Designs, 2011-02-17)
In this paper, we examine the possible orders of t-subset-regular self-complementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's ...
Cyclic Complexity of Some Infinite Words and Generalizations
(Integers, 2018-03)
Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the ...
The minimal automaton recognizing mN in a linear numeration system
(Integers, 2011-12-02)
We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component ...
Avoidability index for binary patterns with reversal
(The Electronic Journal of Combinatorics, 2016-02-19)
For every pattern p over the alphabet {x, x^R, y, y^R}, we specify the least k such that p is k-avoidable.
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 ...
A Ternary Square-free Sequence Avoiding Factors Equivalent to abcacba
(The Electronic Journal of Combinatorics, 2016-05-27)
We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we characterize ...