scientific article; zbMATH DE number 2040898

MaRDI QIDQ4452054zbMATH OpenFDO

Authors Heribert Vollmer

Publication date 11 February 2004

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Publication:4938648
• Finite automata with generalized acceptance criteria
• Complexity theory basics: NP and NL
• Improving the classification of complexities
• scientific article; zbMATH DE number 218387

Cited in

(3)

• Improving the classification of complexities
• scientific article; zbMATH DE number 761756 (Why is no real title available?)
• scientific article; zbMATH DE number 1414307 (Why is no real title available?)

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 Q4452054)