Algebraic systems of fixpoint equations $X = F(X)$ arise in various areas of computer science. In this thesis we study algorithms for solving algebraic systems based on Newton's method as proposed by (Esparza, Kiefer, Luttenberger, 2010).
We first investigate the theoretical properties and algorithmics of Newton's method on semirings.
Then we present FPsolve, an efficient and generic implementation of various methods for solving algebraic systems over semirings.
Finally, we explore applications in database theory, formal languages, and natural language processing.
«
Algebraic systems of fixpoint equations $X = F(X)$ arise in various areas of computer science. In this thesis we study algorithms for solving algebraic systems based on Newton's method as proposed by (Esparza, Kiefer, Luttenberger, 2010).
We first investigate the theoretical properties and algorithmics of Newton's method on semirings.
Then we present FPsolve, an efficient and generic implementation of various methods for solving algebraic systems over semirings.
Finally, we explore applicatio...
»