Skip to main content
SpringerLink
Log in

Indistinguishability of Finite-State Automata with Respect to Some Environments

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper deals with the problem of indistinguishability of finite-state automata interacting with the same environment. A method of construction of efficient environments, i.e., the environments for which this problem is algorithmically solvable, is proposed. An example of an inefficient geometric environment is given.

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. V. B. Kudryavtsev,S. V. Alyoshin, andA. S. Podkolzin, An Introduction to the Theory of Automata [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  2. V. B. Kudryavtsev,Sh. Ushchumlich, andG. Kilibarba, “Behavior of automata in labyrinths,” Diskret. Mat., 4, No. 3, 3–28 (1992).

    Google Scholar 

  3. V. M. Glushkov,G. E. Tseitlin, andE. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).

    Google Scholar 

  4. V. B. Kudryavtsev, Functional Systems [in Russian], Izd. MGU, Moscow (1982).

    Google Scholar 

  5. M. E. Gouda,E. G. Manning, andY. T. Yu, “On the progress of communication between two finite-state machines,” Inform. Control., 63 No. 3, 200–216 (1984).

    Google Scholar 

  6. V. I. Grunskaya, “Some properties of trajectories of automata in labyrinths,” Synopsis of Candidate's Thesis in Physical and Mathematical Sciences [in Russian], MGU, Moscow (1994).

    Google Scholar 

  7. I. S. Grunskii andA. N. Kurganskii, “Indistinguishability of finite-state automata with constrained behavior,” Kibern. Sist. Anal., No. 5, 58–72 (1996).

  8. J. C. Shepherdson, “The reduction of two-way automata to one-way automata,” Kibern. Sb., No. 4, 92–98 (1962).

  9. M. O. Rabin andD. Scott, “Finite state machines and their decision problems,” Kibern. Sb., No. 4, 58–91 (1962).

  10. M. Gross andA. Lentin, Notions sur les Grammaires Formelles [Russian translation], Mir, Moscow (1971).

    Google Scholar 

  11. I. S. Grunskii,V. A. Kozlovskii, andG. G. Ponomarenko, Representation of Finite Automata by Fragments of Their Behavior [in Russian], Naukova Dumka, Kiev (1990).

    Google Scholar 

  12. M. Minsky, Computation: Finite and Infinite Machines [Russian translation], Mir, Moscow (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk, Ukraine

    A. N. Kurganskii

Authors
  1. A. N. Kurganskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kurganskii, A.N. Indistinguishability of Finite-State Automata with Respect to Some Environments. Cybernetics and Systems Analysis 37, 33–41 (2001). https://doi.org/10.1023/A:1016659815354

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016659815354

Search

Navigation