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 |
Concurrency and automata on infinite sequences
|
|---|---|
| Book title |
Theoretical Computer Science
|
| Published by |
Springer Berlin Heidelberg, February 1981
|
| DOI | 10.1007/bfb0017309 |
| Book ISBNs |
978-3-54-010576-3, 978-3-54-038561-5
|
| Authors |
David Park, Park, David |
Mendeley readers
The data shown below were compiled from readership statistics for 120 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Germany | 4 | 3% |
| United Kingdom | 4 | 3% |
| Italy | 2 | 2% |
| Canada | 2 | 2% |
| Netherlands | 1 | <1% |
| Uganda | 1 | <1% |
| Switzerland | 1 | <1% |
| Lithuania | 1 | <1% |
| Australia | 1 | <1% |
| Other | 5 | 4% |
| Unknown | 98 | 82% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 35 | 29% |
| Professor > Associate Professor | 19 | 16% |
| Researcher | 17 | 14% |
| Student > Master | 16 | 13% |
| Student > Bachelor | 8 | 7% |
| Other | 19 | 16% |
| Unknown | 6 | 5% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 95 | 79% |
| Engineering | 8 | 7% |
| Mathematics | 3 | 3% |
| Linguistics | 1 | <1% |
| Unspecified | 1 | <1% |
| Other | 4 | 3% |
| Unknown | 8 | 7% |