scientific article
From MaRDI portal
Publication:3919065
zbMath0466.68017MaRDI QIDQ3919065
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingprogram transformationredundancyrecursive functionstabulationpebble gamesrecursion elimination
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Discrete mathematics in relation to computer science (68R99)
Related Items
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages ⋮ A transformation method for dynamic-sized tabulation ⋮ Computing abstract decorations of parse forests using dynamic programming and algebraic power series ⋮ Information flow in tabular interpretations for generalized push-down automata ⋮ Directed maximal-cut problems ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ Partial memoization for obtaining linear time behavior of a 2DPDA ⋮ Stack and locally finite transformations on structures with reversible transitions ⋮ Efficient memo-table management strategies ⋮ Recursive information transducers: Computation models ⋮ Time complexity of loop-free two-way pushdown automata ⋮ A simulation result for two-way pushdown automata ⋮ Polyvariant mixed computation for analyzer programs
