scientific article; zbMATH DE number 3640911
From MaRDI portal
Publication:4199563
zbMath0412.68078MaRDI QIDQ4199563
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
storageparsingpebble gamecodings of particular directed acyclic graphsdeterministic polynomial time recognizable languages
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Directed graphs (digraphs), tournaments (05C20)
Related Items
Static-memory-hard functions, and modeling the cost of space vs. time, Unnamed Item, 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
