Add to ORKGWe introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages over string diagrams. We use the algebra of monoidal and cartesian restriction categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.Comment: Full version of a paper accepted for MFCS 202
htmlabstractThe main goal in this paper is to use a dual equivalence in automata theory started in [...
AbstractWe give a 3-categorical, purely formal argument explaining why on the category of Kleisli al...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
The syntactic monoid of a language is generalized to the level of a symmetricmonoidal closed categor...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
We show that some results from the theory of group automata and monoid automata still hold for more...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
There are different notions of computation, the most popular being monads, applicative functors, and...
In this document, we introduce tools to describe languages in terms of monoids and in terms of first...
monoidal categories are a natural setting to study automata automata based on actions, languages are...
The program-over-monoid model of computation originates with Barrington's proof that the model captu...
Abstract There are numerous textbooks on regular languages. Many of them focus on fi-nite automata f...
AbstractProofs of propositions about ordinary categories, e.g. the Yoneda Lemma, may often be reinte...
This is a report on aspects of the theory and use of monoidal categories. The first section introduc...
htmlabstractThe main goal in this paper is to use a dual equivalence in automata theory started in [...
AbstractWe give a 3-categorical, purely formal argument explaining why on the category of Kleisli al...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
The syntactic monoid of a language is generalized to the level of a symmetricmonoidal closed categor...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
We show that some results from the theory of group automata and monoid automata still hold for more...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
There are different notions of computation, the most popular being monads, applicative functors, and...
In this document, we introduce tools to describe languages in terms of monoids and in terms of first...
monoidal categories are a natural setting to study automata automata based on actions, languages are...
The program-over-monoid model of computation originates with Barrington's proof that the model captu...
Abstract There are numerous textbooks on regular languages. Many of them focus on fi-nite automata f...
AbstractProofs of propositions about ordinary categories, e.g. the Yoneda Lemma, may often be reinte...
This is a report on aspects of the theory and use of monoidal categories. The first section introduc...
htmlabstractThe main goal in this paper is to use a dual equivalence in automata theory started in [...
AbstractWe give a 3-categorical, purely formal argument explaining why on the category of Kleisli al...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...