Formal Grammars
A Journal of Mathematical Research on Formal and Natural Languages

Editor-in-chief: Carlos Martín-Vide
Special issues
Introduction
Volume 7(2004)
Volume 8(2005)
Editorial board
Aims and Scope
Subscription to the Hardcopy Edition
Submission procedure


Languages Generated Using an Abstract Catenation

ANDREI POPESCU
Department of Fundamentals of Computer Science, University of Bucharest, Romania
Academiei 14, Bucharest, Romania
e-mail: uuomul@yahoo.com

Abstract

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.).

Download:
PS file
PDF file
Copyright © 2004 GRLMC. All rights reserved.
Research Group on Mathematical Linguistics - Rovira i Virgili University
Webmaster