The class of languages captured by Constrained Automata (CA) that are unambiguous is
shown to possess more closure properties than the provably weaker class captured by …

In this paper we relate two generalisations of the finite monoid recognisers of automata
theory for the study of circuit complexity classes: Boolean spaces with internal monoids and …

Profinite equations are an indispensable tool for the algebraic classification of formal
languages. Reiterman's theorem states that they precisely specify pseudovarieties, ie …

Complexity theory and the theory of regular languages both belong to the branch of
computer science where the use of resources in computing is the main focus. However, they …

Tree-Structured Problems and Parallel Computation Page 1 Tree-Structured Problems and Parallel
Computation Dissertation der Mathematisch-Naturwissenschaftlichen Fakultät der Eberhard …

The Parikh automaton model equips a finite automaton with integer registers and imposes a
semilinear constraint on the set of their final settings. Here the theories of typed monoids and …

Following recent works that connect two-variable logic to circuits and monoids, as well as
recent techniques for obtaining algebraic and logical characterizations of threshold circuits …

Some contributions to the algebraic theory of automata - Dialnet Ayuda ¿En qué podemos
ayudarle? × Buscar en la ayuda Buscar Consultar la ayuda ¿En qué podemos ayudarle? × …

This thesis presents a study from the theoretical computer science perspective of computing
models combining finite automata and arithmetic constraints. We focus on decidability …

The Parikh automaton model equips a finite automaton with integer registers and imposes a
semilinear constraint on the set of their final settings. Here the theory of typed monoids is …