Rough Sets on State Spaces of Automata

Thumbnail Image
Files
753-stanek.pdf(550.59 KB)
Date
2016
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
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.
Description
Keywords
Iterations, Kuratowski-Whyburn equivalence, equivalence, monoid, quasi-automaton, upper closure
Citation
Proceedings of the 22nd Conference STUDENT EEICT 2016. s. 753-757. ISBN 978-80-214-5350-0
http://www.feec.vutbr.cz/EEICT/
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
DOI
URI
http://hdl.handle.net/11012/84033
Collections
Student EEICT 2016
Citace PRO