DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
2008 ◽
Vol 19
(04)
◽
pp. 813-826
◽
Keyword(s):
In this paper, the descriptional complexity of extended finite splicing systems is studied. These systems are known to generate exactly the class of regular languages. Upper and lower bounds are shown relating the size of these splicing systems, defined as the total length of the rules and the initial language of the system, to the size of their equivalent minimal nondeterministic finite automata (NFA). In addition, an accepting model of extended finite splicing systems is studied. Using this variant one can obtain systems which are more than polynomially more succinct than the equivalent NFA or generating extended finite splicing system.
2003 ◽
Vol 14
(06)
◽
pp. 1087-1102
◽
2005 ◽
Vol 16
(05)
◽
pp. 975-984
◽
2014 ◽
Vol 25
(07)
◽
pp. 877-896
◽
2008 ◽
Vol 19
(04)
◽
pp. 751-765
◽
2016 ◽
Vol 28
(1)
◽
pp. 14-44
◽
Keyword(s):
2018 ◽
Vol 29
(02)
◽
pp. 251-270
◽