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.
Automata and Logics for Words and Trees over an Infinite Alphabet
Computer Science Logic
Springer Berlin Heidelberg, January 2006
The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.
|Members of the public||1||100%|
The data shown below were compiled from readership statistics for 25 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||9||36%|
|Student > Doctoral Student||2||8%|
|Student > Master||2||8%|
|Readers by discipline||Count||As %|