scientific article; zbMATH DE number 3388535
From MaRDI portal
Publication:5657644
zbMATH Open0245.68003MaRDI QIDQ5657644FDOQ5657644
Authors: John Cocke, Jacob T. Schwartz 
Publication date: 1970
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45)
Cited In (25)
- On graph rewritings
- Profitability computations on program flow graphs
- Sparse RNA folding: time and space efficient algorithms
- 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
- Experience with a conversational parser generating system
- The analysis of Quicksort programs
- If the current clique algorithms are optimal, so is Valiant's parser
- Purging in an equality data base
- Monotone data flow analysis frameworks
- Dynamic Programming Algorithms as Products of Weighted Logic Programs
- Pathlistings applied to data flow analysis
- Some properties of fully reducible graphs
- Efficient parallel and incremental parsing of practical context-free languages
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- On digraphs with a rooted tree structure
- Fast algorithms for the elimination of common subexpressions
- Products of weighted logic programs
- Formal languages for integer programming modeling of shift scheduling problems
- A region analysis algorithm for the live variables problem
- Semantic decomposition of computer programs: An aid to program testing
- Optimization of structured programs
- Representations of the language recognition problem for a theorem prover
- One-variable context-free hedge automata
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 Q5657644)
