The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘ · ’ which is not necessarily associative. It is well known that L can be recognized by a groupoid iff L is context-free. But it is also known that some subclasses of groupoids can only recognize regular languages. For example, loops re...

We will show that deformation quantization in skein theory of oriented 3-manifolds is induced from a topological deformation quantization of the fundamental 2-groupoid of the space of immersions of circles in M . The structure of skein module and its relations with string topology homomorphisms appear through representations of the groupoid structure into the set the objects. The deformation of...

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz & Gabbay (1994) as ‘sequences of rewrites’, computational paths can be seen as the grounds on which the propositional equality between two computational objects stand. Using computational paths and categorical semantics, we take any type A of type theory and construct a ...

We extend the notion of the cardinality of a discrete groupoid (equal to the Euler characteristic of the corresponding discrete orbifold) to the setting of Lie groupoids. Since this quantity is an invariant under equivalence of groupoids, we call it the volume of the associated stack rather than of the groupoid itself. Since there is no natural measure in the smooth case like the counting measu...

We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as the appropriate algebraic structures for dealing with conditional symmetries in Constraint Satisfaction Problems (CSPs). We formally define the Full Conditional Symmetry Groupoid associated with any CSP, giving bounds fo...

In the general setting of groupoid enriched categories, notions of suspender and looper of a map are introduced, formalizing a generalization of the classical homotopy-theoretic notions of suspension and loop space. The formalism enables subtle analysis of these constructs. In particular, it is shown that the suspender of a principal coaction splits as a coproduct. This result leads to the noti...

This study was inspired by recent successful applications of evolutionary computation to the problem of finding terms to represent arbitrarily given operations on a primal groupoid. Evolution requires that small changes in a term result in small changes in the associated term operation. We prove a theorem giving two readily testable conditions under which a groupoid must have this continuity pr...

A groupoid should be thought of as a group with many objects, or with many identities. A precise definition is given below. A groupoid with one object is essentially just a group. So the notion of groupoid is an extension of that of groups. It gives an additional convenience, flexibility and range of applications, so that even for purely group-theoretical work, it can be useful to take a path t...

We show that relations in Homflypt type skein theory of an oriented [Formula: see text]-manifold text] are induced from a text]-groupoid defined the fundamental space singular links text]. The module by homomorphisms related to string topology. They appear representation groupoid into free modules on set model objects. construction is singularity stratification and relates Vassiliev theory. Sev...