Javascript must be enabled for the correct page display

On the algebraicity and automaticity of generalized power series

Kruizinga, H.K. (2016) On the algebraicity and automaticity of generalized power series. Master's Thesis / Essay, Mathematics.

[img]
Preview
Text
thesis.pdf - Published Version

Download (363kB) | Preview
[img] Text
Toestemming.pdf - Other
Restricted to Backend only

Download (422kB)

Abstract

We consider generalized power series over a finite field. We look at the relation between the algebraic degree of such series over the polynomial ring F_q(t) and the size of the finite automaton accepting the exponents. This was done before for the regular power series, by examining the proof of Christol's theorem. With the recent expansion of this theorem, we try to obtain similar results for generalized power series. Given an automaton, we found a bound on the algebraic degree. For the other direction we only point out the steps to obtain a bound.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 08:13
Last Modified: 15 Feb 2018 08:13
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/14137

Actions (login required)

View Item View Item