Skip to main content

Some Intrinsic Properties of Interacting Deterministic Finite Automata

  • Conference paper
  • 679 Accesses

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

Abstract

The agent controllability of the environment is investigated using simple deterministic interacting automata pair model. For this purpose, a general extended design approach for such couple is developed. In the experiments, we focused on simple binary state case and generated stability/cycle behavior characteristics map for the couple. Examinations on the map showed that the behavior of the couple shows some initial value sensitivity. Also, we observed some non-controllable agent/environment couple definition which may imply an inherent communication border between agent and the environment.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspray, W., Burks, A.W.: Papers of John Von Neumann on Computing and Computer Theory. MIT Press, Cambridge (1987)

    Google Scholar 

  2. Chebotarev, A.N., Morokhovets, M.K.: Resolution-based Approach to Compatibility Analysis of Interacting Automata. Theoretical Computer Science 194(1–2), 183–205 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Rosenschein, S.J., Kaelbling, L.P.: A Situated View of Representation and Control. Artificial Intelligence 73, 149–173 (1995)

    Article  Google Scholar 

  4. Kurganski, A.N.: Indistinguishability of Finite-State Automata with respect to Some Environments. Cybernetics abd Systems Analysis 37(1), 33–41 (2001)

    Article  Google Scholar 

  5. Kurgaev, A.F., Petrenko, N.G.: Processor Structure Design. Cybernetics abd Systems Analysis 31(4), 618–625 (1995)

    Article  MATH  Google Scholar 

  6. Buchholz, T., Klein, A., Kutrib, M.: On Interacting Automata with Limited Nondeterminism. Fund. Inform. 52(1-3), 15–38 (2002)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kılç, H. (2003). Some Intrinsic Properties of Interacting Deterministic Finite Automata. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

  • Online ISBN: 978-3-540-39737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics