This study provides quantitative evidence on UK public attitudes towards stateless people, comparing them with attitudes towards refugees and asylum seekers. A cross-sectional UK survey (n = 385) was conducted. Network analysis modelled associations between social policy attitudes and prejudice towards stateless people, refugees, and asylum seekers, alongside other variables, including political orientation and perceived threat. Social policy attitudes were more restrictive towards stateless people than refugees, but less restrictive than towards asylum seekers. Prejudice towards stateless people was not significantly different to that towards refugees or asylum seekers. Prejudice and social policy attitudes were highly interrelated between all three groups, with political orientation and perceived threat the strongest predictors. Findings demonstrate similarities in UK public attitudes towards stateless people, refugees, and asylum seekers. Awareness-raising interventions and interventions addressing political and threat-based narratives may be most effective in reducing discrimination and fostering inclusion of stateless people.

We introduce and investigate several variants of a bidirectional string assemblingsystem, which is a computational model that generates strings from copies of assemblyunits. The underlying mechanism is based on two-sided piecewise assembly of adouble-stranded sequence of symbols, where the upper and lower strand have to match. Thegenerative capacities and the relative power of the variants are our main interest. Inparticular, we prove that bidirectional string assembling system generate languages notrepresented as any finite concatenation of one-sided string assembling systems. The latterbuild an infinite, strict and tight concatenation hierarchy. Moreover, it is shown thateven the strongest system in question can only generate NL languages, while there areunary regular languages that cannot be derived. Furthermore, a finite strict hierarchywith respect to the different variants considered is shown and closure properties of thelanguages generated are presented.

We introduce and investigate string assembling systems which form a computational 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. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction of assembly units that may appear at the beginning, during, and at the end of the assembling process. We start to explore the generative capacity of string assembling systems. In particular, we prove that any such system can be simulated by some nondeterministic one-way two-head finite automaton, while the stateless version of the two-head finite automaton marks to some extent a lower bound for the generative capacity. Moreover, we obtain several incomparability and undecidability results as well as (non-)closure properties, and present questions for further investigations.