FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2008, VOLUME 14, NUMBER 7, PAGES 223-231

**On concrete characterization of universal hypergraphic automata**

E. V. Khvorostukhina

Abstract

View as HTML
View as gif image

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.

Location: http://mech.math.msu.su/~fpm/eng/k08/k087/k08719h.htm

Last modified: June 25, 2009