How Powerful Are Infinite Time Machines?
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Quasi-star-free languages on infinite words
Acta Cybernetica
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Effective characterizations of simple fragments of temporal logic using prophetic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Hi-index | 0.00 |