𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Finite Automata, Formal Logic, and Circuit Complexity

✍ Scribed by Howard Straubing

Publisher
BirkhΓ€user Basel
Year
1994
Tongue
English
Leaves
237
Series
Progress in Theoretical Computer Science
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

The study of the connections between mathematical automata and formal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first-order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the logical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic.

πŸ“œ SIMILAR VOLUMES

Finite Automata, Formal Logic, and Circu
πŸ“ Finite Automata, Formal Logic, and Circuit Complexity
✍ Howard Straubing πŸ“‚ Library πŸ“… 1994 πŸ› BirkhΓ€user Basel 🌐 English

<p>The study of the connections between mathematical automata and forΒ­ mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of firstΒ­ order predi

Logic, Automata, and Computational Compl
πŸ“ Logic, Automata, and Computational Complexity
✍ Bruce M. Kapron, editor πŸ“‚ Library πŸ“… 2023 πŸ› Association for Computing Machinery 🌐 English

Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and

Weighted Automata, Formal Power Series a
πŸ“ Weighted Automata, Formal Power Series and Weighted Logic
✍ Laura Wirth πŸ“‚ Library πŸ“… 2022 πŸ› Springer Spektrum 🌐 English

<span>The main objective of this work is to represent the behaviors of weighted automata by expressively equivalent formalisms: rational operations on formal power series, linear representations by means of matrices, and weighted monadic second-order logic.Β <br>First, we exhibit the classical result

Weighted Automata, Formal Power Series a
πŸ“ Weighted Automata, Formal Power Series and Weighted Logic (BestMasters)
✍ Laura Wirth πŸ“‚ Library πŸ“… 2022 πŸ› Springer Spektrum 🌐 English

<span>The main objective of this work is to represent the behaviors of weighted automata by expressively equivalent formalisms: rational operations on formal power series, linear representations by means of matrices, and weighted monadic second-order logic. <br>First, we exhibit the classical result