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 |
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets
|
---|---|
Chapter number | 18 |
Book title |
Descriptional Complexity of Formal Systems
|
Published by |
Springer, Berlin, Heidelberg, July 2012
|
DOI | 10.1007/978-3-642-31623-4_18 |
Book ISBNs |
978-3-64-231622-7, 978-3-64-231623-4
|
Authors |
Alexander Meduna, Lukáš Vrábel, Petr Zemek, Meduna, Alexander, Vrábel, Lukáš, Zemek, Petr |
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 > Postgraduate | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |