Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (Theoretical Computer Science and General Issues)

$32.83

This book offers advanced insights into automata theory for graduate students and researchers in computer science.

Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (Theoretical Computer Science and General Issues)
Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (Theoretical Computer Science and General Issues)
$32.83

[wpforms id=”1190″ title=”true” description=”Request a call back”]

The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology. “…the thesis of Michal Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.

Additional information

Weight 0.34 lbs
Dimensions 15.5 × 1.3 × 23.5 in

Reviews

There are no reviews yet.

Be the first to review “Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (Theoretical Computer Science and General Issues)”

Your email address will not be published. Required fields are marked *