scientific article; zbMATH DE number 3562520

From MaRDI portal

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

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

Publication:4134970

Jump to:navigation, search

zbMath0361.68071MaRDI QIDQ4134970

Edward L. Robertson

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

The complementation problem for Büchi automata with applications to temporal logic ⋮ THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Simple interpretations among complicated theories ⋮ Alternating automata, the weak monadic theory of trees and its complexity

This page was built for publication:

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