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 |
Minimal NFA problems are hard
|
---|---|
Chapter number | 169 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, January 1991
|
DOI | 10.1007/3-540-54233-7_169 |
Book ISBNs |
978-3-54-054233-9, 978-3-54-047516-3
|
Authors |
Tao Jiang, B. Ravikumar |
Editors |
Javier Leach Albert, Burkhard Monien, Mario Rodríguez Artalejo |
Mendeley readers
The data shown below were compiled from readership statistics for 20 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 5% |
Canada | 1 | 5% |
Unknown | 18 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 5 | 25% |
Researcher | 3 | 15% |
Student > Master | 2 | 10% |
Professor | 1 | 5% |
Other | 1 | 5% |
Other | 2 | 10% |
Unknown | 6 | 30% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 13 | 65% |
Linguistics | 1 | 5% |
Unknown | 6 | 30% |