Counter machines and crystallographic structures
DOI10.1007/S11047-015-9527-0zbMATH Open1415.68133DBLPjournals/nc/JonoskaKM16OpenAlexW1961478591WikidataQ41021339 ScholiaQ41021339MaRDI QIDQ2003451FDOQ2003451
Authors: Milé Krajčevski, Nataşa Jonoska, Gregory Loren McColm 
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc5012322
Recommendations
- Crystal structures and cellular automata
- Crystallographic number systems
- scientific article; zbMATH DE number 1182938
- Counter machines
- Crystal structure on rigged configurations
- scientific article; zbMATH DE number 1001504
- Frameworks with crystallographic symmetry
- scientific article; zbMATH DE number 4073297
- Crystal structure, x-ray diffraction and oblique geometry
- scientific article; zbMATH DE number 480252
Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other geometric groups, including crystallographic groups (20H15)
Cites Work
- Complexity classes for self-assembling flexible tiles
- A mathematical bibliography of signed and gain graphs and allied areas
- Title not available (Why is that?)
- Flexible Versus Rigid Tile Assembly
- Title not available (Why is that?)
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Handbook of Graph Theory
- Title not available (Why is that?)
- Generating all graph coverings by permutation voltage assignments
- Title not available (Why is that?)
- Groups, graphs and trees. An introduction to the geometry of infinite groups.
- Voltage graphs
- Nomenclature and generation of three-periodic nets: the vector method
- Title not available (Why is that?)
- ON GROUPS AND COUNTER AUTOMATA
- Formal Languages and Groups as Memory
- An infinite hierarchy of intersections of context-free languages
- Title not available (Why is that?)
- One-reversal counter machines and multihead automata: revisited
- Refining nondeterminism in context-free languages
- Equilibrium placement of periodic graphs and convexity of plane tilings
- Minimal nets
- Languages Associated with Crystallographic Symmetry
- Generating Geometric Graphs Using Automorphisms
- On Two-Way Transducers
- Graph-theoretical characterization of periodicity in crystallographic nets and other infinite graphs
This page was built for publication: Counter machines and crystallographic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003451)
