Pushdown timed automata: a binary reachability characterization and safety verification

  • Authors:
  • Zhe Dang

  • Affiliations:
  • School of Electrical Engineering and Computer Science, Washington State Unviersity, Pullman, WA

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties ...