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 |
Finite Automata as Regular Language Recognizers
|
|---|---|
| Chapter number | 3 |
| Book title |
Formal Languages and Compilation
|
| Published by |
Springer, London, January 2009
|
| DOI | 10.1007/978-1-84882-050-0_3 |
| Book ISBNs |
978-1-84882-049-4, 978-1-84882-050-0
|
| Authors |
Stefano Crespi Reghizzi |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United States | 1 | 20% |
| Unknown | 4 | 80% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Doctoral Student | 1 | 20% |
| Student > Bachelor | 1 | 20% |
| Student > Ph. D. Student | 1 | 20% |
| Student > Master | 1 | 20% |
| Researcher | 1 | 20% |
| Other | 0 | 0% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 4 | 80% |
| Engineering | 1 | 20% |