Related papers: On tractability and congruence distributivity
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
We study the validity of congruence inclusions of the form $ \alpha ( \beta \circ \alpha \gamma \circ \beta \circ \dotsc \circ \alpha \gamma \circ \beta ) \subseteq \alpha \beta \circ \alpha \gamma \circ \alpha \beta \circ \dots$ in…
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
It is shown that for every language family that is a trio containing only semilinear languages, all bounded languages in it can be accepted by one-way deterministic reversal-bounded multicounter machines (DCM). This implies that for every…
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…
An identity s=t is linear if each variable occurs at most once in each of the terms s and t. Let T be a tolerance relation of an algebra A in a variety defined by a set of linear identities. We prove that there exist an algebra B in the…
We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…
In this paper, a new invariant was built towards the classification of separable C*-algebras of real rank zero, which we call latticed total K-theory. A classification theorem is given in terms of such an invariant for a large class of…
We solve some problems about relative lengths of Maltsev conditions, in particular, we give an affirmative answer to a classical problem raised by A. Day more than fifty years ago. In detail, both congruence distributive and congruence…
We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…
Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of…
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. Regular constraints restrict valid substitutions of…
A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary…
We show that a variety $\mathcal V$ is congruence distributive if and only if there is some $h$ such that the inclusion (1) $\Theta \cap ( \sigma \circ \sigma ) \subseteq ( \Theta \cap \sigma ) \circ ( \Theta \cap \sigma ) \circ \dots $…
Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…
A well-known approach to treating syntactic island constraints in the setting of Lambek grammars consists in adding specific bracket modalities to the logic. We adapt this approach to abstract categorial grammars (ACG). Thus we define…