Automata methods in transcendence
Dinesh S. Thakur
University of Rochester, USA
A subscription is required to access this book chapter.
Abstract
The purpose of this expository article is to explain diverse new tools that automata theory provides to tackle transcendence problems in function field arithmetic. We collect and explain various useful results scattered in computer science, formal languages, logic literature and explain how they can be fruitfully used in number theory, dealing with transcendence, refined transcendence and classification problems.