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 |
The State Complexity of Permutations on Finite Languages over Binary Alphabets
|
---|---|
Chapter number | 19 |
Book title |
Descriptional Complexity of Formal Systems
|
Published by |
Springer, Cham, June 2015
|
DOI | 10.1007/978-3-319-19225-3_19 |
Book ISBNs |
978-3-31-919224-6, 978-3-31-919225-3
|
Authors |
Alexandros Palioudakis, Da-Jung Cho, Daniel Goč, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa |
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 % |
---|---|---|
Student > Master | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |