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 |
On the cardinality of sets of infinite trees recognizable by finite automata
|
---|---|
Chapter number | 80 |
Book title |
Mathematical Foundations of Computer Science 1991
|
Published by |
Springer, Berlin, Heidelberg, September 1991
|
DOI | 10.1007/3-540-54345-7_80 |
Book ISBNs |
978-3-54-054345-9, 978-3-54-047579-8
|
Authors |
Damian Niwiński |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 17% |
Unknown | 5 | 83% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 33% |
Student > Master | 2 | 33% |
Researcher | 1 | 17% |
Professor > Associate Professor | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 67% |
Philosophy | 1 | 17% |
Unknown | 1 | 17% |