AbstractThis paper studies context-free sets of finite and infinite words. In particular, it gives a natural way of associating to a language a set of infinite words. It then becomes possible to begin a study of families of sets of infinite words rather similar to the classical studies of families of languages
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
International audienceIn this paper, we study languages of finite and infinite birooted words. We sh...
We investigate properties of locally finite languages introduced by J-P. Ressayre. These languages a...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
AbstractWe present a method of generating infinite words from selective substitution grammars introd...
This paper is an introduction to the algebraic theory of infinite words. Infinite words are widely u...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
AbstractThe paper investigates infinite words, and sets of them, associated with DOL and DTOL system...
AbstractThe algebraic theory we present here continues the earlier work of several authors. The lead...
The thesis presents results obtained during the authors PhD-studies. First systems of language equat...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
International audienceIn this paper, we study languages of finite and infinite birooted words. We sh...
We investigate properties of locally finite languages introduced by J-P. Ressayre. These languages a...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
AbstractWe present a method of generating infinite words from selective substitution grammars introd...
This paper is an introduction to the algebraic theory of infinite words. Infinite words are widely u...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
AbstractThe paper investigates infinite words, and sets of them, associated with DOL and DTOL system...
AbstractThe algebraic theory we present here continues the earlier work of several authors. The lead...
The thesis presents results obtained during the authors PhD-studies. First systems of language equat...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
International audienceIn this paper, we study languages of finite and infinite birooted words. We sh...
We investigate properties of locally finite languages introduced by J-P. Ressayre. These languages a...
DOI
Add to ORKG