Related papers: Functorial languages in homological algebra and lo…
This text is based on lectures given by authors in summer 2015. It contains an introduction to the theory of limits over the category of presentations, with examples of different well-known functors like homology or derived functors of…
Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…
This thesis explores how concepts of formal language theory can be used to study left-orderable groups. It analyses the languages formed by their positive cones and demonstrates how the abstract families of languages (AFLs) in the Chomsky…
In this paper, homological methods together with the theory of formal languages of theoretical computer science are proved to be effective tools to determine the growth and the Hilbert series of an associative algebra. Namely, we construct…
Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields. Practically all of…
For a strongly connected category $\mathcal C$ with pair-wise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of ${\sf lim} : \mathrm{Ab}^{\mathcal C}\to…
A theory of higher colimits over categories of free presentations is developed. It is shown that different homology functors such as Hoshcshild and cyclic homology of algebras over a field of characteristic zero, simplicial derived…
The purpose of this work is to complete the algebraic foundations of second-order languages from the viewpoint of categorical algebra as developed by Lawvere. To this end, this paper introduces the notion of second-order algebraic theory…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.
GF(2)-grammars are a recently introduced grammar family with some unusual algebraic properties. They are closely connected to unambiguous grammars. By using the method of formal power series, we establish strong conditions that are…
First we define a unification grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this…
Suppose we are given complex manifolds $X$ and $Y$ together with substacks $\mathcal{S}$ and $\mathcal{S}'$ of modules over algebras of formal deformation $\mathcal{A}$ on $X$ and $\mathcal{A}'$ on $Y$, respectively. Suppose also we are…
We attach to each weak model category $\mathcal{M}$ a class of first order formulas about the fibrant objects of $\mathcal{M}$ whose validity is invariant under homotopies and weak equivalences. This is a generalization of the classical…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We…
We study the notion of fundamental group in the framework of descent-exact homological categories. This setting is sufficiently wide to include several categories of "algebraic" nature such as the almost abelian categories, the semi-abelian…
A lot of well-known functors such as group homology, cyclic homology of algebras can be described as limits of certain simply defined functors over categories of presentations. In this paper, we develop technique for the description of the…
GF(2)-grammars are a somewhat recently introduced grammar family that have some unusual algebraic properties and are closely connected to unambiguous grammars. In "Bounded languages described by GF(2)-grammars", Makarov proved a necessary…
We give closed-form expressions for the Laurent series coefficients of the Gamma function near all its strictly negative singularities. These closed-form expressions are clearly self-similar. We briefly describe their algebraic and…