Universal Hypergraphic Automata Representation by Autonomous Input Symbols
Hypergraphic automata are automata with state sets and input symbol sets being hypergraphs which are invariant under actions of transition and output functions. Universally attracting objects of a category of hypergraphic automata are automata Atm(H1,H2). Here, H1 is a state hypergraph, H2 is classi...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2018-10-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/757 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|