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
-
On edge product hypergraphs
by: Kishor F. Pawar, et al.
Published: (2021-06-01) -
On domination in an edge product hypergraphs
by: Kishor F. Pawar, et al.
Published: (2021-12-01) -
Hypergraph models of hydrocarbon molecules and their applications in computer chemistry
by: M. I. Skvortsova, et al.
Published: (2014-10-01) -
STHFD: Spatial–Temporal Hypergraph-Based Model for Aero-Engine Bearing Fault Diagnosis
by: Panfeng Bao, et al.
Published: (2025-07-01) -
About Berge–Füredi’s conjecture on the chromatic index of hypergraphs
by: Bretto, Alain, et al.
Published: (2025-04-01)