AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to specifications of these classes from algebraic, computational and logical points of view
International audienceComputing the image of a regular language by the transitive closure of a relat...
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
It is well known that the class of regular languages coincides with the class of languages recognize...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
We extend the notion of regular sets of strings to those of trees and of forests in a unified mathem...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
In this paper we develop the language theory of higher-dimensional automata (HDAs). Regular language...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
International audienceComputing the image of a regular language by the transitive closure of a relat...
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
It is well known that the class of regular languages coincides with the class of languages recognize...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
We extend the notion of regular sets of strings to those of trees and of forests in a unified mathem...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
In this paper we develop the language theory of higher-dimensional automata (HDAs). Regular language...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
International audienceComputing the image of a regular language by the transitive closure of a relat...
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
DOI
Add to ORKG