Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time.

Volumn , Issue , 1988, Pages 422-427

  Muller, David E ^a   Saoudi, Ahmed ^a   Schupp, Paul E ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY -- FORMAL LOGIC;

DYNAMIC LOGIC; EXPONENTIAL DECIDABILITY; TEMPORAL LOGIC; WEAK ALTERNATING AUTOMATA;

AUTOMATA THEORY;

EID: 0024140989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)