AbstractThis paper is a continuation of the work by Landweber [5], to clarify the relationship between classes of ω-languages accepted by finite automata. We study their properties in the topological framework introduced by Boasson and Nivat [1]. We characterize the classes in terms of Borel hierarchy, and show some interrelation of them
AbstractThis paper is a continuation of [3]. It gives some further properties of limited regular lan...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
AbstractIn this paper, we give language-theoretical representations for some classes of ω- languages...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractBy applying descriptive set theory to the Wagner's fine structure of regular ω-languages we ...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
A semi-commutation $R$ is a relation on a finite alphabet $A$. Given an infinite word $u$ on $A$, we...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
A semi-commutation $R$ is a relation on a finite alphabet $A$. Given an infinite word $u$ on $A$, we...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractWe study and compare several mechanisms for defining sets of biinfinite words (ωω-languages)...
In the present paper,we prove that the n-bounded duplication closure of a regular language is regula...
AbstractLanguages with infinite words have often been studied as subsets of a topological space. The...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
AbstractThis paper is a continuation of [3]. It gives some further properties of limited regular lan...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
AbstractIn this paper, we give language-theoretical representations for some classes of ω- languages...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractBy applying descriptive set theory to the Wagner's fine structure of regular ω-languages we ...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
A semi-commutation $R$ is a relation on a finite alphabet $A$. Given an infinite word $u$ on $A$, we...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
A semi-commutation $R$ is a relation on a finite alphabet $A$. Given an infinite word $u$ on $A$, we...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractWe study and compare several mechanisms for defining sets of biinfinite words (ωω-languages)...
In the present paper,we prove that the n-bounded duplication closure of a regular language is regula...
AbstractLanguages with infinite words have often been studied as subsets of a topological space. The...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
AbstractThis paper is a continuation of [3]. It gives some further properties of limited regular lan...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
DOI
Add to ORKG