scientific article; zbMATH DE number 3640911

zbMATH Open0412.68078MaRDI QIDQ4199563FDOQ4199563

Stephen Cook, Ravi Sethi

Publication date: 1974

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

zbMATH Keywords

parsingstoragepebble gamecodings of particular directed acyclic graphsdeterministic polynomial time recognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20)

Cited In (4)

• Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
• On the complexity of finite, pushdown, and stack automata
• Title not available (Why is that?)
• Static-memory-hard functions, and modeling the cost of space vs. time

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