Rough Sets on State Spaces of Automata
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.
KeywordsIterations, Kuratowski-Whyburn equivalence, equivalence, monoid, quasi-automaton, upper closure
Document typePeer reviewed
Document versionxmlui.vut.verze.Publishers's version
SourceProceedings of the 22nd Conference STUDENT EEICT 2016. s. 753-757. ISBN 978-80-214-5350-0
- Student EEICT 2016