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.

1.
L.
 
Kari
, “
On Insertion and Deletion in Formal Languages
”, Ph.D. thesis,
University of Turku
(
1991
).
Google Scholar
 
2.
W. H.
 
Fong
,
M.
 
Holzer
,
B.
 
Truthe
,
S.
 
Turaev
, and
A. F.
 
Yosman
, “
On Bonded Sequential and Parallel Insertion Systems
,” in
Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA)
, edited by H. B.
et
 
al.
, books@ocg.at,
Österreichische Computer Gesellschaft
,
Austria
,
2016
, pp.
163
–
178
.
Google Scholar
 
3.
A. F.
 
Yosman
,
M.
 
Holzer
,
B.
 
Truthe
,
W. H.
 
Fong
, and
S.
 
Turaev
, “
Two Variants of Bonded Parallel Insertion Systems and Their Generative Power
,” in
Proceedings of the 6th International Graduate Conference on Engineering, Science and Humanities (IGCESH) 2016
,
Universiti Teknologi Malaysia
,
Johor Bahru, Malaysia
,
2016
, pp.
418
–
420
.
Google Scholar
 
4.
L.
 
Kari
, and
G.
 
Thierrin
,
Information and Computation
 
131
,
47
–
61
(
1996
).
https://doi.org/10.1006/inco.1996.0091
Google Scholar
Crossref
Search ADS
 
5.
L.
 
Kari
,
Gh.
 
Păun
,
G.
 
Thierrin
, and
Sh.
 
Yu
, “
At the Crossroads of DNA Computing and Formal Languages: Characterizing RE using Insertion-Deletion Systems
,” in
Proceedings of 3rd DIMACS Workshop on DNA Based Computing
,
1999
, pp.
318
–
333
.
Google Scholar
 
6.
A.
 
Takahara
, and
T.
 
Yokomori
,
Natural Computing
 
2
,
321
–
336
(
2003
).
https://doi.org/10.1023/B:NACO.0000006769.27984.23
Google Scholar
Crossref
Search ADS
 
7.
S.
 
Verlan
,
Computer Science Journal of Moldova
 
18
,
210
–
245
(
2010
).
Google Scholar
 
8.
A.
 
Krassovitskiy
, “
Complexity and Modeling Power of Insertion-Deletion Systems
”, Ph.D. thesis,
Universitat Rovira i Virgili
(
2011
).
Google Scholar
 
9.
Y. S.
 
Gan
,
W. H.
 
Fong
,
N. H.
 
Sarmin
, and
S.
 
Turaev
,
Malaysian Journal of Fundamental and Applied Sciences
 
8
,
24
–
30
(
2012
).
Google Scholar
 
10.
Y. S.
 
Gan
,
W. H.
 
Fong
,
N. H.
 
Sarmin
, and
S.
 
Turaev
,
Malaysian Journal of Fundamental and Applied Sciences
 
9
,
35
–
40
(
2013
).
Google Scholar
 
11.
W. H.
 
Fong
,
Y. S.
 
Gan
,
N. H.
 
Sarmin
, and
S.
 
Turaev
, “
Automata Diagram over Abelian Groups
,” in
AIP Conference Proceedings
,
2013
.
Google Scholar
 
12.
W. H.
 
Fong
,
Y. S.
 
Gan
,
N. H.
 
Sarmin
, and
S.
 
Turaev
, “
Automata for Subgroups
,” in
AIP Conference Proceedings
,
2014
.
Google Scholar
 
13.
G.
 
Rozenberg
, and
A.
 
Salomaa
,
Handbook of Formal Languages
,
Springer-Verlag
,
Berlin
,
1997
.
Google Scholar
 
14.
J. B.
 
Fraleigh
,
A First Course in Abstract Algebra, 7th Edition
,
Addison Wesley
,
2003
.
Google Scholar
 
15.
G.
 
Rozenberg
, and
A.
 
Salomaa
,
The Mathematical Theory of L-systems
,
Academic Press
,
1980
.
Google Scholar
 
This content is only available via PDF.
© 2017 Author(s).
2017
Author(s)
You do not currently have access to this content.