Publication detail

Rough Sets on State Spaces of Automata

STANĚK, D.

Original Title

Rough Sets on State Spaces of Automata

Type

conference paper

Language

English

Original 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

Iterations, Kuratowski-Whyburn equivalence, equivalence, monoid, quasi-automaton, upper closure.

Authors

STANĚK, D.

Released

28. 4. 2016

Publisher

Vysoké učení technické v Brně, FEKT

Location

Brno

ISBN

978-80-214-5350-0

Book

Studen EEICT Proceedings of the 22nd conference

Pages from

753

Pages to

757

Pages count

5

URL

http://www.feec.vutbr.cz/EEICT/

BibTex

@inproceedings{BUT124484,
  author="David {Staněk}",
  title="Rough Sets on State Spaces of Automata",
  booktitle="Studen EEICT
Proceedings of the 22nd conference",
  year="2016",
  pages="753--757",
  publisher="Vysoké učení technické v Brně, FEKT",
  address="Brno",
  isbn="978-80-214-5350-0",
  url="http://www.feec.vutbr.cz/EEICT/"
}