Rough Sets on State Spaces of Automata

Abstract

This paper discussed a subclass of finite automata, which have ordering on the state sets created by a transition (or next-state) function. Hence, there do not exist cycles of more than one element. We discuss a relation of equality of upper closure on the systems of all subsets of state systems of quasi-automata, which creates an equivalence.