Skip to main content
SpringerLink
Log in

On concrete characterization of universal hypergraphic automata

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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 of defining 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. V. Khvorostukhina, “On concrete characterization of universal hypergraphic automata,” Int. Algebraic Conf. on the Occasion of the 100th Anniversary of Professor A. G. Kurosh. Abstracts, Moscow (2008), pp. 241–242.

  2. A. V. Molchanov, “On definability of hypergraphic automaton by their exit functions,” in: Theoretical Problems of Informatics and Its Applications, Vol. 2 [in Russian], Saratov (1998), pp. 74–84.

  3. A. V. Molchanov, “Endomorphism semigroups of weak p-hypergraphs,” Izv. Vysch. Uchebn. Zaved., Mat., No. 3, 80–83 (2000).

  4. B. I. Plotkin, L. Ya. Gringlaz, and A. A. Gvaramiya, Elements of Algebraic Automata Theory [in Russian], Vissh. Shkola, Moscow (1994).

    Google Scholar 

  5. A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk, 29, No. 6, 89–154 (1974).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saratov State Social Economic University, Saratov, Russia

    E. V. Khvorostukhina

Authors
  1. E. V. Khvorostukhina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. V. Khvorostukhina.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 7, pp. 223–231, 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khvorostukhina, E.V. On concrete characterization of universal hypergraphic automata. J Math Sci 164, 303–308 (2010). https://doi.org/10.1007/s10958-009-9732-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-009-9732-4

Keywords

Search

Navigation