Skip to main content
SpringerLink
Log in

Self-assembling Finite Automata

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

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

Included in the following conference series:

Abstract

We investigate a model of self-assembling finite automata. An automaton is assembled on demand during its computation from copies out of a finite set of items. The items are pieces of a finite automaton which are connected to the already existing automaton by overlaying states. Depending on the allowed number of such interface states, the degree, infinite hierarchies of properly included language families are shown. The presented model is a natural and unified generalization of regular and context-free languages since degrees one and two are characterizing the finite and pushdown automata, respectively. Moreover, by means of different closure properties nondeterministic and deterministic language families are separated.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Casjens, S. and King, J. Virus assembly. Annual Review of Biochemistry 44 (1975), 555–604.

    Article  Google Scholar 

  2. Klein, A. and Kutrib, M. Self-assembling finite automata. IFIG Research Report 0201, Institute of Informatics, University of Giessen, 2002. http://www.informatik.uni-giessen.de/staff/kutrib/papers.html

  3. Nebel, M. E. On the power of subroutines for finite state machines. J. Aut., Lang. and Comb. 6 (2001), 51–74.

    MATH  MathSciNet  Google Scholar 

  4. Penrose, L. S. Self-reproducing machines. Scientific American 200 (1959), 105–113.

    Article  Google Scholar 

  5. Rubinstein, R. S. and Shutt, J. N. Self-modifying finite automata. Proc. of the IFIP 13th World Computer Congress. Vol. 1: Technology and Foundations, 1994, pp. 493–498.

    Google Scholar 

  6. Rubinstein, R. S. and Shutt, J. N. Self-modifying finite automata-power and limitations. Technical Report WPI-CS-TR-95-4, Computer Science Department, Worcester Polytechnic Institute, 1995.

    Google Scholar 

  7. Rubinstein, R. S. and Shutt, J. N. Self-modifying finite automata: An introduction. Inform. Process. Lett. 56 (1995), 185–190.

    Article  MATH  MathSciNet  Google Scholar 

  8. Saitou, K. and Jakiela, M. J. On classes of one-dimensional self-assembling automata. Complex Systems 10 (1996), 391–416.

    MATH  MathSciNet  Google Scholar 

  9. Wang, Y., Inoue, K., Ito, A., and Okazaki, T. A note on self-modifying finite automata. Inform. Process. Lett. 72 (1999), 19–24.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Kassel, Heinrich Plett Straße 40, D-34132, Kassel, Germany

    Andreas Klein

  2. Institut für Informatik, Universität Giessen, Arndtstraße 2, D-35392, Giessen, Germany

    Martin Kutrib

Authors
  1. Andreas Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klein, A., Kutrib, M. (2002). Self-assembling Finite Automata. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation