Inproceedings,

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time

, , and .
LICS, page 422-427. IEEE Computer Society, (1988)

Meta data

Tags

Users

  • @dblp

Comments and Reviews