Generating finite cyclic and dihedral groups using sequential insertion systems with interactions
The operation of insertion has been studied extensively throughout the years for its impact in many areas of theoretical computer science such as DNA computing. First introduced as a generalization of the concatenation operation, many variants of insertion have been introduced, each with their own c...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English English |
| Published: |
American Institute of Physics
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/58704/1/58704_Generating%20finite%20cyclic%20and%20dihedral.pdf http://irep.iium.edu.my/58704/2/58704_Generating%20finite%20cyclic%20and%20dihedral_SCOPUS.pdf http://irep.iium.edu.my/58704/13/58704%20Generating%20finite%20cyclic%20and%20dihedral%20groups%20WOS.pdf http://irep.iium.edu.my/58704/ http://aip.scitation.org/doi/abs/10.1063/1.4980954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Islam Antarabangsa Malaysia |
| Language: | English English English |
| Summary: | The operation of insertion has been studied extensively throughout the years for its impact in many areas of theoretical computer science such as DNA computing. First introduced as a generalization of the concatenation operation, many variants of insertion have been introduced, each with their own computational properties. In this paper, we introduce a new variant that enables the generation of some special types of groups called sequential insertion systems with interactions. We show that these new systems are able to generate all finite cyclic and dihedral groups. |
|---|