Shulamit Halamish

  • Citations Per Year
Learn More
Traditional automata accept or reject their input and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The special case of <i>lattice automata</i>, in which the semiring is a finite lattice, has interesting theoretical properties as well as applications in formal methods. A <i>minimal(More)
  • 1