Search results for "Computation theory"
showing 10 items of 336 documents
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
On the exhaustive generation of k-convex polyominoes
2017
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.
A combinatorial view on string attractors
2021
Abstract The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w 1 w 2 ⋯ w n is a subset Γ of the positions { 1 , … , n } , such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a c…
Classifying G-graded algebras of exponent two
2019
Let F be a field of characteristic zero and let $$\mathcal{V}$$ be a variety of associative F-algebras graded by a finite abelian group G. If $$\mathcal{V}$$ satisfies an ordinary non-trivial identity, then the sequence $$c_n^G(\mathcal{V})$$ of G-codimensions is exponentially bounded. In [2, 3, 8], the authors captured such exponential growth by proving that the limit $$^G(\mathcal{V}) = {\rm{lim}}_{n \to \infty} \sqrt[n]{{c_n^G(\mathcal{V})}}$$ exists and it is an integer, called the G-exponent of $$\mathcal{V}$$ . The purpose of this paper is to characterize the varieties of G-graded algebras of exponent greater than 2. As a consequence, we find a characterization for the varieties with …
On operads, bimodules and analytic functors
2017
We develop further the theory of operads and analytic functors. In particular, we introduce a bicategory that has operads as 0-cells, operad bimodules as 1-cells and operad bimodule maps as 2-cells, and prove that this bicategory is cartesian closed. In order to obtain this result, we extend the theory of distributors and the formal theory of monads.
Minimal forbidden patterns of multi-dimensional shifts
2005
We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.
On generalised FC-groups in which normality is a transitive relation
2016
We extend to soluble FC∗ -groups, the class of generalised FC-groups introduced in [F. de Giovanni, A. Russo, G. Vincenzi, Groups with restricted conjugacy classes , Serdica Math. J. 28(3) (2002), 241 254], the characterisation of finite soluble T-groups obtained recently in [G. Kaplan, On T-groups, supersolvable groups and maximal subgroups , Arch. Math. 96 (2011), 19 25].
On the Parameterization of Cartesian Genetic Programming
2020
In this work, we present a detailed analysis of Cartesian Genetic Programming (CGP) parametrization of the selection scheme ($\mu+\lambda$), and the levels back parameter l. We also investigate CGP’s mutation operator by decomposing it into a self-recombination, node function mutation, and inactive gene randomization operators. We perform experiments in the Boolean and symbolic regression domains with which we contribute to the knowledge about efficient parametrization of two essential parameters of CGP and the mutation operator.
Motzkin subposets and Motzkin geodesics in Tamari lattices
2014
The Tamari lattice of order n can be defined by the set D n of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin words in this structure. This distance can also be interpreted as the length of a geodesic between these Motzkin words in a Tamari lattice. So, a new upper bound is obtained for the classical rotation distance between two Motzkin words in a Tamari lattice. For some specific pairs of Motzkin words, this b…