scientific article; zbMATH DE number 3586493

zbMATH Open0376.68040MaRDI QIDQ4153609FDOQ4153609

Authors: Neil D. Jones, William T. Laaser 

Publication date: 1974

Title of this publication is not available (Why is that?)

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
• Title not available (Why is that?)
• 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)