scientific article; zbMATH DE number 3586493

From MaRDI portal

Revision as of 11:29, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4153609

Jump to:navigation, search

zbMath0376.68040MaRDI QIDQ4153609

Neil D. Jones, William T. Laaser

Publication date: 1974

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (9)

Unnamed Item ⋮ Automata for XML -- a survey ⋮ Relativization of questions about log space computability ⋮ On the complexity of finite, pushdown, and stack automata ⋮ Storage requirements for deterministic polynomial time recognizable languages ⋮ Log space machines with multiple oracle tapes ⋮ On log-tape isomorphisms of complete sets ⋮ Linear programming is log-space hard for P ⋮ Gainfree Leontief substitution flow problems

This page was built for publication:

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