Marcos Vinícius Silva Alves

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we present a new property of relative observability, and based on this property, we propose two algorithms to deal with relative observability of regular languages. The first algorithm, that has polynomial complexity, verifies if a regular language is relatively observable. The second algorithm, that computes the supremal relatively(More)
  • 1