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
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
AbstractA class of decision problems is Boolean if it is closed under the set-theoretic operations o...
It is well known that the class of regular languages coincides with the class of languages recognize...
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Eh...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
We consider two formalisms for representing regular languages: constant height pushdown automata an...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
International audienceWe explore the theory of regular language representations in the constructive ...
We introduce an infinite proper subset of regular languages (RL), so called the state change couple ...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
AbstractA class of decision problems is Boolean if it is closed under the set-theoretic operations o...
It is well known that the class of regular languages coincides with the class of languages recognize...
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Eh...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
We consider two formalisms for representing regular languages: constant height pushdown automata an...
We introduce regular languages of morphisms in free monoidal categories, with their associated gramm...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
International audienceWe explore the theory of regular language representations in the constructive ...
We introduce an infinite proper subset of regular languages (RL), so called the state change couple ...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressi...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
This paper argues that an algebraic approach to regular languages, such as using monoids, can yield ...
DOI
Add to ORKG