scientific article; zbMATH DE number 3388535
From MaRDI portal
Publication:5657644
zbMath0245.68003MaRDI QIDQ5657644
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items
On digraphs with a rooted tree structure, If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser, Purging in an equality data base, One-variable context-free hedge automata, Formal languages for integer programming modeling of shift scheduling problems, Experience with a conversational parser generating system, Pathlistings applied to data flow analysis, Efficient parallel and incremental parsing of practical context-free languages, Finite constants: Characterizations of a new decidable set of constants, Applications of graph theory in computer systems, Conditional congruence closure over uninterpreted and interpreted symbols, Products of weighted logic programs, Sparse RNA folding: time and space efficient algorithms, Semantic decomposition of computer programs: An aid to program testing, A large neighbourhood search approach to the multi-activity shift scheduling problem, Some properties of fully reducible graphs, Optimization of structured programs, The analysis of Quicksort programs, Profitability computations on program flow graphs, Monotone data flow analysis frameworks, Inter-procedural Two-Variable Herbrand Equalities, Dynamic Programming Algorithms as Products of Weighted Logic Programs, Fast algorithms for the elimination of common subexpressions, A region analysis algorithm for the live variables problem, On graph rewritings, Representations of the language recognition problem for a theorem prover
