The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Finite Automata, Formal Logic, and Circuit Complexity
The work
| Authors | Howard Straubing |
|---|---|
| Editors | |
| Type | book |
| Year | 1994 |
| Also known as | c1994finite |
| Citekey | straubing1994finite |
Identifiers
| DOI | 10.1007/978-1-4612-0289-9 |
|---|---|
| OpenAlex | W200063938 |
Access
| Landing page | https://doi.org/10.1007/978-1-4612-0289-9 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
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 ho
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-24 17:57 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@book{straubing1994finite,
title = {Finite Automata, Formal Logic, and Circuit Complexity},
author = {Howard Straubing},
year = {1994},
doi = {10.1007/978-1-4612-0289-9},
}
This record lives at https://refs.drheap.org/straubing1994finite/ and will keep
doing so. It used to be called c1994finite, and those addresses still resolve to this one.