scientific article; zbMATH DE number 3562520

MaRDI QIDQ4134970zbMATH OpenFDO

Authors Edward L. Robertson

Publication date 1974

Mathematics Subject Classification ID

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

Cited in

(5)

• Simple interpretations among complicated theories
• The recognition complexity of decidable theories
• The complementation problem for Büchi automata with applications to temporal logic
• 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

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)