A formal power series \u3c6 with a real cut point \u3bb defines the language L_{\u3c6,\u3bb} = {\u3c9 08 \u3a3 17 | |\u3c6(\u3c9) > \u3bb}; \u3bb is called isolated if inf_\u3c9 |\u3c6(\u3c9) 12 \u3bb| > 0. In this paper we give conditions for guaranteeing the regularity of L_{\u3c6,\u3bb}, with \u3bb isolated, for two classes of formal series: rational series and Hadamard quotients of rational series. Finally, we provide an explicit representation of the behavior of a subclass of two-way weighted automata in terms of Hadamard quotient of rational series
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
AbstractWe prove that the ranking problem for unambiguous context-free languages is NC1-reducible to...
AbstractIn this paper, we introduce the split game, a variant of the Ehrenfeucht–Fraïssé game from l...
Let L_{f,\u3bb} = {\u3c9 in \u3a3* | f(\u3c9) > \u3bb} be the language recognized by a formal series...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
We study the series realized by weighted two-way automata, that are strictly more powerful than weig...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
In the classical theory of formal languages, finite state automata allow to recognize the words of a...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
Abstract We present the state of the art in the field of generating series for formal languages. The...
Abstract. In this paper we show that ωB- and ωS-regular languages satisfy the following separation-t...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
We study the connections between rational series with coefficients in a semiring and their languages...
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
AbstractWe prove that the ranking problem for unambiguous context-free languages is NC1-reducible to...
AbstractIn this paper, we introduce the split game, a variant of the Ehrenfeucht–Fraïssé game from l...
Let L_{f,\u3bb} = {\u3c9 in \u3a3* | f(\u3c9) > \u3bb} be the language recognized by a formal series...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
We study the series realized by weighted two-way automata, that are strictly more powerful than weig...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
In the classical theory of formal languages, finite state automata allow to recognize the words of a...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
Abstract We present the state of the art in the field of generating series for formal languages. The...
Abstract. In this paper we show that ωB- and ωS-regular languages satisfy the following separation-t...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
We study the connections between rational series with coefficients in a semiring and their languages...
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages e...
AbstractWe prove that the ranking problem for unambiguous context-free languages is NC1-reducible to...
AbstractIn this paper, we introduce the split game, a variant of the Ehrenfeucht–Fraïssé game from l...