Related papers: On Varieties of Ordered Automata

Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…

Since the 1970s with the work of McNaughton, Papert and Sch\"utzenberger, a regular language is known to be definable in the first-order logic if and only if its syntactic monoid is aperiodic. This algebraic characterisation of a…

Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the…

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Given an order of the underlying alphabet we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When the order on strings is the co-lexicographic one \emph{and}…

We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…

Let $d$ be a positive integer. In a previous article we established a bijective correspondence between the following classes of objects, considered up to the appropriate notion of equivalence: differential graded algebras with…

The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The problem of determining for a given regular tree language whether…

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the…

The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K \in {Q, Q +, R, R+}. A rational stochastic language is a probability distribution over a free monoid…

We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets.

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…

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…

Let $R$ be a commutative artinian ring. We extend higher Auslander correspondence from Artin $R$-algebras of finite representation type to dualizing $R$-varieties. More precisely, for a positive integer $d$, we show that a dualizing…

Why do some languages like Czech permit free word order, while others like English do not? We address this question by pretraining transformer language models on a spectrum of synthetic word-order variants of natural languages. We observe…

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

We give analogues of the Auslander correspondence for two classes of triangulated categories satisfying certain finiteness conditions. The first class is triangulated categories with additive generators and we consider their endomorphism…

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We…