Skip to content

Opening book details…

Can I read Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) on EtoBox?

Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) by Howard Straubing is a computer science book available to read on EtoBox.

What is Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) about?

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 predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subj

Who reads Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)?

It is typically read by working professionals who need an authoritative practice reference.

Common subject areas: medicine, law, business, engineering.

Author
Howard Straubing
Publisher
Birkhäuser Boston
Published
2012
Language
EN
ISBN
9780817637194
Category
computer science
Subjects
Mathematics, Science, Computer Science
Updated
2026-03-16

Other editions & translations

More by Howard Straubing

Browse all works by Howard Straubing

Similar books