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 |
Finite Automata, Digraph Connectivity, and Regular Expression Size
|
---|---|
Chapter number | 4 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, July 2008
|
DOI | 10.1007/978-3-540-70583-3_4 |
Book ISBNs |
978-3-54-070582-6, 978-3-54-070583-3
|
Authors |
Hermann Gruber, Markus Holzer |
Mendeley readers
The data shown below were compiled from readership statistics for 41 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 2% |
United States | 1 | 2% |
Germany | 1 | 2% |
Unknown | 38 | 93% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 15 | 37% |
Student > Master | 6 | 15% |
Researcher | 5 | 12% |
Lecturer | 3 | 7% |
Student > Postgraduate | 3 | 7% |
Other | 5 | 12% |
Unknown | 4 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 28 | 68% |
Engineering | 3 | 7% |
Mathematics | 2 | 5% |
Agricultural and Biological Sciences | 1 | 2% |
Physics and Astronomy | 1 | 2% |
Other | 1 | 2% |
Unknown | 5 | 12% |