Original title: Rough Sets on State Spaces of Automata
Authors: Staněk, David
Document type: Papers
Language: eng
Publisher: Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
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.
Keywords: equivalence; Iterations; Kuratowski-Whyburn equivalence; monoid; quasi-automaton; upper closure
Host item entry: Proceedings of the 22nd Conference STUDENT EEICT 2016, ISBN 978-80-214-5350-0

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/84033

Permalink: http://www.nusl.cz/ntk/nusl-383751


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Conference materials > Papers