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 |
Algebras for classifying regular tree languages and an application to frontier testability
|
---|---|
Chapter number | 85 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 1993
|
DOI | 10.1007/3-540-56939-1_85 |
Book ISBNs |
978-3-54-056939-8, 978-3-54-047826-3
|
Authors |
Thomas Wilke, Wilke, 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 % |
---|---|---|
Australia | 1 | 33% |
Unknown | 2 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 33% |
Lecturer | 1 | 33% |
Unknown | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 33% |
Engineering | 1 | 33% |
Unknown | 1 | 33% |