scientific article; zbMATH DE number 1834679

zbMath0999.68088MaRDI QIDQ4779175

Ogihara, Mitsunori

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360585

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Weak minimization of DFA -- an algorithm and applications

This page was built for publication: