Program equivalence and context-free grammars

DOI10.1016/S0022-0000(75)80057-2zbMath0315.68063MaRDI QIDQ1221492

Barry K. Rosen

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N01: General topics in the theory of software

Related Items

Some equivalent transformations of recursive programs based on their schematic properties, Fundamental properties of infinite trees, A representation of trees by languages. II, DPDA's in 'Atomic normal form' and applications to equivalence problems, Tree equivalence of linear recursive schemata is polynomial-time decidable, Categories of chain-complete posets, A representation of trees by languages. I, The tree equivalence of linear recursion schemes, \(L(A)=L(B)\)? decidability results from complete formal systems, Recursion induction principle revisited, Infinite trees in normal form and recursive equations having a unique solution, Recursive converters on a memory, Unnamed Item

Cites Work

• Regular expressions and the equivalence of programs
• On formalised computer programs
• Translating recursion equations into flow charts
• Characterization of flowchartable recursions
• Decidable Properties of Monadic Functional Schemas
• Inductive methods for proving properties of programs
• Formal models for some features of programming languages
• Properties of deterministic top-down grammars
• On Classes of Program Schemata
• Tree-Manipulating Systems and Church-Rosser Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item