Rough Sets on State Spaces of Automata

Simple item page
but.event.date28.04.2016cs
but.event.titleStudent EEICT 2016cs
dc.contributor.authorStaněk, David
dc.date.accessioned2018-07-10T12:48:22Z
dc.date.available2018-07-10T12:48:22Z
dc.date.issued2016cs
dc.description.abstractThis 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.en
dc.formattextcs
dc.format.extent753-757cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationProceedings of the 22nd Conference STUDENT EEICT 2016. s. 753-757. ISBN 978-80-214-5350-0cs
dc.identifier.isbn978-80-214-5350-0
dc.identifier.urihttp://hdl.handle.net/11012/84033
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.relation.ispartofProceedings of the 22nd Conference STUDENT EEICT 2016en
dc.relation.urihttp://www.feec.vutbr.cz/EEICT/cs
dc.rights© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.rights.accessopenAccessen
dc.subjectIterationsen
dc.subjectKuratowski-Whyburn equivalenceen
dc.subjectequivalenceen
dc.subjectmonoiden
dc.subjectquasi-automatonen
dc.subjectupper closureen
dc.titleRough Sets on State Spaces of Automataen
dc.type.driverconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.departmentFakulta elektrotechniky a komunikačních technologiícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
753-stanek.pdf
Size:
550.59 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Student EEICT 2016