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 |
Automata and Logics for Unranked and Unordered Trees
|
---|---|
Chapter number | 36 |
Book title |
Term Rewriting and Applications
|
Published in |
Lecture notes in computer science, April 2005
|
DOI | 10.1007/978-3-540-32033-3_36 |
Book ISBNs |
978-3-54-025596-3, 978-3-54-032033-3
|
Authors |
Iovka Boneva, Jean-Marc Talbot, Boneva, Iovka, Talbot, Jean-Marc |
Editors |
Jürgen Giesl |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 75% |
Professor > Associate Professor | 1 | 25% |
Student > Doctoral Student | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 125% |