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 |
Descriptional Complexity of Unambiguous Nested Word Automata
|
---|---|
Chapter number | 33 |
Book title |
Language and Automata Theory and Applications
|
Published by |
Springer, Berlin, Heidelberg, May 2011
|
DOI | 10.1007/978-3-642-21254-3_33 |
Book ISBNs |
978-3-64-221253-6, 978-3-64-221254-3
|
Authors |
Alexander Okhotin, Kai Salomaa, Okhotin, Alexander, Salomaa, Kai |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |