scientific article; zbMATH DE number 2040922

zbMATH Open1037.68087MaRDI QIDQ4452078FDOQ4452078

Andreas Malcher

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100386.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (5)

• Title not available (Why is that?)
• Minimal NFA Problems are Hard
• Title not available (Why is that?)
• A maxmin problem on finite automata
• Title not available (Why is that?)

Recommendations

• Minimal NFA Problems are Hard 👍 👎
• Minimizing finite automata is computationally hard 👍 👎
• Minimisation of automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452078)