scientific article; zbMATH DE number 3562520

zbMATH Open0361.68071MaRDI QIDQ4134970FDOQ4134970

Authors: Edward L. Robertson 

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 (5)

• A uniform method for proving lower bounds on the computational complexity of logical theories
• Alternating automata, the weak monadic theory of trees and its complexity
• The recognition complexity of decidable theories
• Simple interpretations among complicated theories
• The complementation problem for Büchi automata with applications to temporal logic

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