Xref: utzoo comp.lang.misc:5490 comp.lang.lisp:3685
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!inria!enstb!beugnard
From: beugnard@enstb.enst-bretagne.fr (Antoine Beugnard)
Newsgroups: comp.lang.misc,comp.lang.lisp,net.math,net.lang
Subject: deseperatly seeking a regular expressions shuffle algorithm
Keywords: shuffle, regular expressions
Message-ID: <319@enstb.enst-bretagne.fr>
Date: 20 Sep 90 13:43:21 GMT
Organization: enst-bretagne Brest, FRANCE
Lines: 22

I am seeking an algorithm that calculates the regular expression
 resulting from the shuffle of two others.

	example : (@ denotes the shuffle operation)
				a  @ b     = a.b + b.a
				a* @ x.y.z = a*.x.a*.y.a*.z.a*

The main problems are related to:
- the * operation defined as a closure...
	a* = null + a + a.a + a.a.a + a.a.a.a + ...

- the nested structure of regular expressions 
	((a.b)*.((c.(d)*.e)* + u))...

I'll be pleased to receive any information related to such an algorithm,
and to transmit it to anybody interested in.

My e-mail address is

	beugnard@enstb.enst-bretagne.fr

Thank you.