You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
| Title |
Finite Automata, Formal Logic, and Circuit Complexity
|
|---|---|
| Published by |
Birkhäuser Boston, January 1994
|
| DOI | 10.1007/978-1-4612-0289-9 |
| ISBNs |
978-1-4612-6695-2, 978-1-4612-0289-9
|
| Authors |
Howard Straubing, Straubing, Howard |
Mendeley readers
The data shown below were compiled from readership statistics for 33 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United Kingdom | 1 | 3% |
| Spain | 1 | 3% |
| United States | 1 | 3% |
| Unknown | 30 | 91% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 7 | 21% |
| Researcher | 5 | 15% |
| Professor > Associate Professor | 3 | 9% |
| Student > Master | 3 | 9% |
| Professor | 3 | 9% |
| Other | 3 | 9% |
| Unknown | 9 | 27% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 14 | 42% |
| Engineering | 3 | 9% |
| Mathematics | 2 | 6% |
| Agricultural and Biological Sciences | 1 | 3% |
| Philosophy | 1 | 3% |
| Other | 2 | 6% |
| Unknown | 10 | 30% |