scientific article; zbMATH DE number 10087
From MaRDI portal
Publication:4713368
zbMath0744.68074MaRDI QIDQ4713368
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An Approach to Computing Downward Closures, General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond, The obstructions of a minor-closed set of graphs defined by a context-free grammar, Cost Automata, Safe Schemes, and Downward Closures, On the state complexity of closures and interiors of regular languages with subwords and superwords, Derivation Tree Analysis for Accelerated Fixed-Point Computation, The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed, Derivation tree analysis for accelerated fixed-point computation, Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity, Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads, General decidability results for asynchronous shared-memory programs: higher-order and beyond, Unnamed Item
