Automata, Languages and Programming
Springer Science & Business Media
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.
Timeline
Mendeley readers
| Chapter title |
Realizability and Verification of MSC Graphs
|
|---|---|
| Chapter number | 65 |
| Book title |
Automata, Languages and Programming
|
| Published by |
Springer, Berlin, Heidelberg, July 2001
|
| DOI | 10.1007/3-540-48224-5_65 |
| Book ISBNs |
978-3-54-042287-7, 978-3-54-048224-6, 978-3-54-042287-7, 978-3-54-048224-6
|
| Authors |
Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
Mendeley readers
The data shown below were compiled from readership statistics for 21 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Germany | 1 | 5% |
| Italy | 1 | 5% |
| Unknown | 19 | 90% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Researcher | 5 | 24% |
| Student > Ph. D. Student | 5 | 24% |
| Professor > Associate Professor | 3 | 14% |
| Student > Master | 2 | 10% |
| Student > Doctoral Student | 1 | 5% |
| Other | 2 | 10% |
| Unknown | 3 | 14% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 16 | 76% |
| Physics and Astronomy | 1 | 5% |
| Unknown | 4 | 19% |