Fundamentalʹnaâ i prikladnaâ matematika, Tome 14 (2008) no. 7, pp. 223-231
Citer cet article
E. V. Khvorostukhina. On concrete characterization of universal hypergraphic automata. Fundamentalʹnaâ i prikladnaâ matematika, Tome 14 (2008) no. 7, pp. 223-231. http://geodesic.mathdoc.fr/item/FPM_2008_14_7_a18/
@article{FPM_2008_14_7_a18,
author = {E. V. Khvorostukhina},
title = {On concrete characterization of universal hypergraphic automata},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {223--231},
year = {2008},
volume = {14},
number = {7},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2008_14_7_a18/}
}
TY - JOUR
AU - E. V. Khvorostukhina
TI - On concrete characterization of universal hypergraphic automata
JO - Fundamentalʹnaâ i prikladnaâ matematika
PY - 2008
SP - 223
EP - 231
VL - 14
IS - 7
UR - http://geodesic.mathdoc.fr/item/FPM_2008_14_7_a18/
LA - ru
ID - FPM_2008_14_7_a18
ER -
%0 Journal Article
%A E. V. Khvorostukhina
%T On concrete characterization of universal hypergraphic automata
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2008
%P 223-231
%V 14
%N 7
%U http://geodesic.mathdoc.fr/item/FPM_2008_14_7_a18/
%G ru
%F FPM_2008_14_7_a18
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.