Add to ORKG© 2019, IFIP International Federation for Information Processing. We study relationships of monotone well quasiorders to regular languages and ω-languages, concentrating on decidability of the lattices of upper sets on words and infinite words. We establish rather general sufficient conditions for decidability. Applying these conditions to concrete natural monotone WQOs, we obtain new decidability results and new proofs of some known results
In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
Abstract. We develop an algebraic model for recognizing languages of words indexed by countable line...
© 2019, IFIP International Federation for Information Processing. We study relationships of monotone...
International audienceWe study relationships of monotone well quasiorders to regular languages and $...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
AbstractWe study an extension of first-order logic obtained by adjoining quantifiers that count with...
AbstractBy means of constructing suitable well quasi-orders of free monoids we prove that all maxima...
AbstractWe study (i) regular languages that are polylog-time reducible to languages of dot-depth 1/2...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
International audienceWe develop an algebraic model for recognizing languages of words indexed by co...
AbstractMany interesting subclasses of ω-regular languages have been characterized in terms of the p...
The purpose of this paper is to provide efficient algorithms that decide membership for classes of s...
In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
Abstract. We develop an algebraic model for recognizing languages of words indexed by countable line...
© 2019, IFIP International Federation for Information Processing. We study relationships of monotone...
International audienceWe study relationships of monotone well quasiorders to regular languages and $...
AbstractIn “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeu...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
AbstractWe study an extension of first-order logic obtained by adjoining quantifiers that count with...
AbstractBy means of constructing suitable well quasi-orders of free monoids we prove that all maxima...
AbstractWe study (i) regular languages that are polylog-time reducible to languages of dot-depth 1/2...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
International audienceWe develop an algebraic model for recognizing languages of words indexed by co...
AbstractMany interesting subclasses of ω-regular languages have been characterized in terms of the p...
The purpose of this paper is to provide efficient algorithms that decide membership for classes of s...
In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
Abstract. We develop an algebraic model for recognizing languages of words indexed by countable line...