scientific article; zbMATH DE number 3586493

MaRDI QIDQ4153609zbMATH OpenFDO

Authors Neil D. Jones, William T. Laaser

Publication date 1974

Mathematics Subject Classification ID

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

Cited in

(9)

• Log space machines with multiple oracle tapes
• Automata for XML -- a survey
• On the complexity of finite, pushdown, and stack automata
• On log-tape isomorphisms of complete sets
• Linear programming is log-space hard for P
• scientific article; zbMATH DE number 3576701 (Why is no real title available?)
• Gainfree Leontief substitution flow problems
• Relativization of questions about log space computability
• Storage requirements for deterministic polynomial time recognizable languages

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