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 |
A Chomsky-Like Hierarchy of Infinite Graphs
|
---|---|
Chapter number | 14 |
Book title |
Mathematical Foundations of Computer Science 2002
|
Published by |
Springer, Berlin, Heidelberg, August 2002
|
DOI | 10.1007/3-540-45687-2_14 |
Book ISBNs |
978-3-54-044040-6, 978-3-54-045687-2
|
Authors |
Didier Caucal, Teodor Knapik, Caucal, Didier, Knapik, Teodor |
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 % |
---|---|---|
United Kingdom | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 50% |
Researcher | 1 | 25% |
Unknown | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 75% |
Unknown | 1 | 25% |