AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series as a formal corollary from Kleene’s characterisation of the set of regular languages
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
A formal power series \u3c6 with a real cut point \u3bb defines the language L_{\u3c6,\u3bb} = {\u3c...
We begin here the subject of formal power series, objects of the form ∑n=0∞anXn (an∈ R or C) which c...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem ...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
The aim of this paper is to use formal power series techniques to study the structure of small arith...
<p>Not very many results in computer science are recognised as being as basic and fundamental as Kle...
We deepen here the insight on formal power series. We temporarily abandon formality and consider the...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will g...
summary:In this note we investigate a relationship between the boundary behavior of power series and...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractWe prove that the ranking problem for unambiguous context-free languages is NC1-reducible to...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
A formal power series \u3c6 with a real cut point \u3bb defines the language L_{\u3c6,\u3bb} = {\u3c...
We begin here the subject of formal power series, objects of the form ∑n=0∞anXn (an∈ R or C) which c...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem ...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
The aim of this paper is to use formal power series techniques to study the structure of small arith...
<p>Not very many results in computer science are recognised as being as basic and fundamental as Kle...
We deepen here the insight on formal power series. We temporarily abandon formality and consider the...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will g...
summary:In this note we investigate a relationship between the boundary behavior of power series and...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractWe prove that the ranking problem for unambiguous context-free languages is NC1-reducible to...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
A formal power series \u3c6 with a real cut point \u3bb defines the language L_{\u3c6,\u3bb} = {\u3c...
We begin here the subject of formal power series, objects of the form ∑n=0∞anXn (an∈ R or C) which c...
DOI
Add to ORKG