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
| Chapter title |
The Complexity of Translating Logic to Finite Automata
|
|---|---|
| Chapter number | 13 |
| Book title |
Automata Logics, and Infinite Games
|
| Published in |
Lecture notes in computer science, November 2002
|
| DOI | 10.1007/3-540-36387-4_13 |
| Book ISBNs |
978-3-54-000388-5, 978-3-54-036387-3
|
| Authors |
Klaus Reinhardt |
| Editors |
Erich Grädel, Wolfgang Thomas, Thomas Wilke |
Mendeley readers
The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Netherlands | 1 | 7% |
| Unknown | 14 | 93% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor > Associate Professor | 4 | 27% |
| Professor | 3 | 20% |
| Researcher | 3 | 20% |
| Student > Ph. D. Student | 2 | 13% |
| Student > Doctoral Student | 2 | 13% |
| Other | 1 | 7% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 11 | 73% |
| Engineering | 2 | 13% |
| Philosophy | 1 | 7% |
| Unknown | 1 | 7% |