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: | Ekaterina Khvorostukhina, Vladimir Molchanov |
|---|---|
| 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!
|
Similar Items
-
Chain and threshold hypergraphs
by: Shashwath S. Shetty, et al.
Published: (2025-08-01) -
On edge product hypergraphs
by: Kishor F. Pawar, et al.
Published: (2021-06-01) -
Disassembly Plan Representation by Hypergraph
by: Abboy Verkuilen, et al.
Published: (2025-02-01) -
On domination in an edge product hypergraphs
by: Kishor F. Pawar, et al.
Published: (2021-12-01) -
Dynamic Load Balancing Based on Hypergraph Partitioning for Parallel Geospatial Cellular Automata Models
by: Wei Xia, et al.
Published: (2025-03-01)