Languages Generated Using an Abstract Catenation
Andrei Popescu · Gramma · 2004
We present some results regarding languages that are context-free or regular w.r.t. a non-deterministic binary operation on words that is left variable, only asking a few general properties like associativity. This could be part of a unified approach to intertextuality, the results referring, in particular, to important instances of ”putting texts together” operations like concatenation and shuffle (with all their variations - distributed, on trajectories etc.).