scientific article

From MaRDI portal

Revision as of 20:59, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3911391

Jump to:navigation, search

zbMath0461.68046MaRDI QIDQ3911391

David B. Patterson, Stephen L. Bloom

Publication date: 1981

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

zbMATH Keywords

NP-complete recursion equations contraction algebra equivalence problem for deterministic pushdown automata signatures with a finite number of function symbols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of computing (68Q99)

Related Items (1)

Fundamental properties of infinite trees

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3911391&oldid=17572098"