Berstel and Reutenauer stated the iteration theorem for recognizable formal power series on trees over fields and vector spaces. The key idea of its proof is the existence of pseudo-regular matrices in matrix-products. This theorem is generalized to integral domains and modules over integral domains in this thesis. It only requires the reader to have basic knowledge in linear algebra. Concepts from the advanced linear algebra and abstract algebra are introduced in the preliminary chapter.:1. Introduction 2. Preliminaries 3. Long products of matrices 4. Formal power series on trees 5. The generalized iteration theorem 6. Conclusio
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
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 ...
AbstractMatrix iteration theories are characterized by identities using theory operations as well as...
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series ove...
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, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
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 ...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
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 ...
AbstractMatrix iteration theories are characterized by identities using theory operations as well as...
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series ove...
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, ...
Using the decomposition of an automorphism of the ring of formal power series in several variables, ...
AbstractFormal power series are an extension of formal languages. Recognizable formal power series c...
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 ...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
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 ...