Counter machines and crystallographic structures

DOI10.1007/s11047-015-9527-0zbMath1415.68133OpenAlexW1961478591WikidataQ41021339 ScholiaQ41021339MaRDI QIDQ2003451

M. Krajcevski, 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

zbMATH Keywords

context-free languagescounter machinesperiodic digraphscrystallographic structures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other geometric groups, including crystallographic groups (20H15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-reversal counter machines and multihead automata: revisited
• Biased graphs. I: Bias, balance, and gains
• Complexity classes for self-assembling flexible tiles
• Biased graphs. II: The three matroids
• Generating all graph coverings by permutation voltage assignments
• A mathematical bibliography of signed and gain graphs and allied areas
• Equilibrium placement of periodic graphs and convexity of plane tilings
• Voltage graphs
• Minimal nets
• Languages Associated with Crystallographic Symmetry
• Generating Geometric Graphs Using Automorphisms
• Nomenclature and generation of three-periodic nets: the vector method
• ON GROUPS AND COUNTER AUTOMATA
• Formal Languages and Groups as Memory
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Refining nondeterminism in context-free languages
• Handbook of Graph Theory
• On Two-Way Transducers
• Graph-theoretical characterization of periodicity in crystallographic nets and other infinite graphs
• Flexible Versus Rigid Tile Assembly
• An infinite hierarchy of intersections of context-free languages

This page was built for publication: Counter machines and crystallographic structures