Completeness results for the equivalence of recursive schemas

DOI10.1016/S0022-0000(76)80036-0zbMath0342.68008MaRDI QIDQ1232171

Bruno Courcelle, Jean E. Vuillemin

Publication date: 1976

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

03D99: Computability and recursion theory

Related Items

A fast algorithm to decide on the equivalence of stateless DPDA, Fundamental properties of infinite trees, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, A representation of trees by languages. II, DPDA's in 'Atomic normal form' and applications to equivalence problems, A direct algorithm for checking equivalence of LL(k) grammars, A representation of trees by languages. I, On the Yoneda completion of a quasi-metric space, Recursion induction principle revisited, An axiomatic approach to the Korenjak-Hopcroft algorithms, Decidable subcases of the equivalence problem for recursive program schemes, Infinite trees in normal form and recursive equations having a unique solution

Uses Software

• LCF

Cites Work

• LCF considered as a programming language
• Parallel program schemata
• On formalised computer programs
• Inductive methods for proving properties of programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item