Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

DLT
2001

favoriteEmaildiscussreport

78views Theoretical Computer Science» more DLT 2001»

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable

14 years 26 days ago

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable

Download www.labri.fr

Dietrich Kuske

Real-time Traffic

DLT 2001 | DLT 2007 |

claim paper

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	DLT
Authors	Dietrich Kuske

Comments (0)