Regular Languages, Tree Width, and Courcelle's Theorem - Eger, Steffen
33,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
17 °P sammeln
  • Broschiertes Buch

"Regular Languages, Tree Width, and Courcelle's Theorem" provides an introduction to Courcelle's Theorem, a theorem about the complexityof deciding whether a finite mathematical structure satisfies a given logical formula. In this connection, further topics covered in the book include the interplay of logic and regular languages (e.g. Büchi's Theorem) and the graph theoretical concept of tree width, a measure of the similarity of a graph to a tree. The text assumes no previous mathematical knowledge of the reader other than some basic acquaintance with the concept of regular languages.

Andere Kunden interessierten sich auch für
Produktbeschreibung
"Regular Languages, Tree Width, and Courcelle's Theorem" provides an introduction to Courcelle's Theorem, a theorem about the complexityof deciding whether a finite mathematical structure satisfies a given logical formula. In this connection, further topics covered in the book include the interplay of logic and regular languages (e.g. Büchi's Theorem) and the graph theoretical concept of tree width, a measure of the similarity of a graph to a tree. The text assumes no previous mathematical knowledge of the reader other than some basic acquaintance with the concept of regular languages.
Autorenporträt
Steffen Eger received a Master's degree in both Linguistics andMathematics from the University of Heidelberg, Germany. His mainareas of interest include the mathematical modeling of language,logic and computability theory. He is currently working on theAdiuvaris project, a statistical approach to Latin-Germantranslation.