Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T08:06:09.405Z Has data issue: false hasContentIssue false

On the algorithmic complexity of crystals

Published online by Cambridge University Press:  05 July 2018

S. V. Krivovichev*
Affiliation:
Department of Crystallography, Faculty of Geology, St. Petersburg State University, University Emb. 7/9, 199034 St. Petersburg, RussiaNanomaterials Research Centre, Kola Science Centre, Russian Academy of Sciences, Apatity, Russia
*

Abstract

The concept of the algorithmic complexity of crystals is developed for a particular class of minerals and inorganic materials based on orthogonal networks, which are defined as networks derived from the primitive cubic net (pcu) by the removal of some vertices and/or edges. Orthogonal networks are an important class of networks that dominate topologies of inorganic oxysalts, framework silicates and aluminosilicate minerals, zeolites and coordination polymers. The growth of periodic orthogonal networks may be modelled using structural automata, which are finite automata with states corresponding to vertex configurations and transition symbols corresponding to the edges linking the respective vertices. The model proposed describes possible relations between theoretical crystallography and theoretical computer science through the theory of networks and the theory of deterministic finite automata.

Information

Type
Research Article
Copyright
Copyright © The Mineralogical Society of Great Britain and Ireland 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable