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 |
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
|
---|---|
Chapter number | 18 |
Book title |
Language and Automata Theory and Applications
|
Published by |
Springer, Berlin, Heidelberg, March 2008
|
DOI | 10.1007/978-3-540-88282-4_18 |
Book ISBNs |
978-3-54-088281-7, 978-3-54-088282-4
|
Authors |
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren, Champavère, Jérôme, Gilleron, Rémi, Lemay, Aurélien, Niehren, Joachim |
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 > Bachelor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |