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 mathematics 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 self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Howard Straubing
Publisher
Birkhäuser Basel
Published
1994
Language
EN
ISBN
9781461202899
Category
mathematics
Subjects
Science, Mathematics, Computer Science
Updated
2026-03-25

Other editions & translations

More by Howard Straubing

Browse all works by Howard Straubing

Similar books