Abstract
A string assembling system is a generative model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. So, the generative power of such systems is driven by the power of double-strands. Here we compare the generative capacity of string assembling systems with those of different variants of sticker systems. Though both types of systems seem to be closely related, we show that their generative capacities are different. In particular, it turns out that the family of languages generated by string assembling systems is incomparable with several language families induced by sticker systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
