scientific article; zbMATH DE number 3640911

zbMATH Open0412.68078MaRDI QIDQ4199563FDOQ4199563

Authors Ravi Sethi, Stephen Cook

Publication date 1974

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)

• scientific article; zbMATH DE number 3576701 (Why is no real title available?)
• Static-memory-hard functions, and modeling the cost of space vs. time
• On the complexity of finite, pushdown, and stack automata
• Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton 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 Q4199563)