Skip to main content
Springer Nature Link
Log in

On the synthesis of "Irredundant" automata from a finite set of experiments

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 138 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Bibliography

  1. Edward F. Moore, Gedanken-experiments on sequential mechanics, Automata Studies, Ann. of Math. Studies, no.34, Princeton Univ.Press, Princton, N.J., 1956, pp.129–153.

    Google Scholar 

  2. S.A. Bogomolov, On the synthesis of automata from a finite set of experiments. Soviet Math.Dokl., Vol.281 (1985), No.1,pp.20–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saratov Economical Institute, Saratov, USSR

    S. A. Bogomolov

Authors
  1. S. A. Bogomolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bogomolov, S.A. (1987). On the synthesis of "Irredundant" automata from a finite set of experiments. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics