Skip to main content

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 1))

  • 1138 Accesses

Abstract

A memristive automaton is a structurally-dynamic excitable cellular automaton where a link connecting two cells is removed or added if one of the cells is in excited state and another cell is in refractory state.

A cellular automaton \(\mathcal{A}\) is an orthogonal array of uniform finite-state machines, or cells. Each cell takes finite number of states and updates its states in discrete time depending on states of its closest neighbours. All cells update their states simultaneously by the same rule. We consider eight-cell neighbourhood and three cell-states: resting ∘, excited +, and refractory −. Let u(x) = { y: |x − y| L ∞  = 1} be a neighbourhood of cell x. A cell x has a set of incoming links { l xy : y ∈ u(x)} which take states 0 and 1. A link l xy is a link of excitation transfer from cell y to cell x. A link in state 0 is considered to be high-resistant, or non-conductive, and link in state 1 low resistant, or conductive. A link-state \(l^t_{xy}\) is updated depending on states of cells x and y at time step t: \(l^t_{xy} = f(x^t, y^t)\). Resting state gives little indication of cell’s previous history, therefore we will consider only non-resting cells contributing to a link state updates. When cells x and y are in the same state (bother cells are in state + or both are in state −) no ’current’ can flow between the cells, therefore scenarios x t = y t are not taken into account.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrew Adamatzky .

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Adamatzky, A. (2013). Structural Dynamics: Memristive Excitable Automata. In: Reaction-Diffusion Automata: Phenomenology, Localisations, Computation. Emergence, Complexity and Computation, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31078-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31078-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31077-5

  • Online ISBN: 978-3-642-31078-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics