Using the decomposition of an automorphism of the ring of formal power series in several variables, in a semisimple and a unipotent automorphism, I prove in this paper that an automorphism allows a continuous iteration if and only if it is the exponential of a derivation. This result implies a number of results recently obtained by Reich, Schwaiger, and Bucher
AbstractThis paper is concerned with the ring A of all complex formal power series and the group G o...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper, we show a way to characterize the R-automorphisms of formal power series on several i...
Berstel and Reutenauer stated the iteration theorem for recognizable formal power series on trees ov...
AbstractThis paper is concerned with the ring A of all complex formal power series and the group G o...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order ...
In this paper, we show a way to characterize the R-automorphisms of formal power series on several i...
Berstel and Reutenauer stated the iteration theorem for recognizable formal power series on trees ov...
AbstractThis paper is concerned with the ring A of all complex formal power series and the group G o...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...