Sciweavers

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

32

DLT
2004

favoriteEmaildiscussreport

79views Theoretical Computer Science» more DLT 2004»

Decidability and Complexity in Automatic Monoids

14 years 8 days ago

Decidability and Complexity in Automatic Monoids

Download www.informatik.uni-leipzig.de

Markus Lohrey

Real-time Traffic

DLT 2004 | DLT 2007 |

claim paper

Related Content

» Divisibility Monoids Presentation Word Problem and Rational Languages

» Inverse Monoids Decidability and Complexity of Algebraic Questions

» The Quantum Query Complexity of Algebraic Properties

» Automatic Generation of Classification Theorems for Finite Algebras

» Logic Meets Algebra the Case of Regular Languages

» On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory

» Some natural decision problems in automatic graphs

» Tractability Results for Automatic Contracting

» Features and classifiers for the automatic classification of musical audio signals

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	DLT
Authors	Markus Lohrey

Comments (0)