|
Fundamentalnaya i Prikladnaya Matematika, 2008, Volume 14, Issue 7, Pages 223–231
(Mi fpm1186)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On concrete characterization of universal hypergraphic automata
E. V. Khvorostukhina Saratov State Socio-Economic University
Abstract:
In this paper, we consider structured automata without output signals whose state sets are endowed with an algebraic structure of hypergraphs. The main result of the paper is a theorem where we obtain necessary and sufficient conditions for the possibility to define on the state set of some automaton $A$ a structure of a hypergraph $H$ such that the automaton $A$ will be the universal hypergraphic automaton.
Citation:
E. V. Khvorostukhina, “On concrete characterization of universal hypergraphic automata”, Fundam. Prikl. Mat., 14:7 (2008), 223–231; J. Math. Sci., 164:2 (2010), 303–308
Linking options:
https://www.mathnet.ru/eng/fpm1186 https://www.mathnet.ru/eng/fpm/v14/i7/p223
|
|