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 |
Tight Bounds for Complementing Parity Automata
|
---|---|
Chapter number | 42 |
Book title |
Mathematical Foundations of Computer Science 2014
|
Published by |
Springer, Berlin, Heidelberg, August 2014
|
DOI | 10.1007/978-3-662-44522-8_42 |
Book ISBNs |
978-3-66-244521-1, 978-3-66-244522-8
|
Authors |
Sven Schewe, Thomas Varghese, Schewe, Sven, Varghese, Thomas |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 33% |
Other | 1 | 33% |
Unknown | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |
Unknown | 1 | 33% |