Complexity and succinctness issues for linear-time hybrid...

Theoretical Computer Science 2010 Vol. 411; Iss. 2

Complexity and succinctness issues for linear-time hybrid logics

Laura Bozzelli, Ruggero Lanotte
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
411
Year:
2010
Language:
english
Pages:
16
DOI:
10.1016/j.tcs.2009.08.009
File:
PDF, 1.14 MB
english, 2010
Conversion to is in progress
Conversion to is failed