Completeness results for the equivalence of recursive schemas

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

Bruno Courcelle, Jean E. Vuillemin

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80036-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01) Computability and recursion theory (03D99)

Related Items (12)

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

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

This page was built for publication: Completeness results for the equivalence of recursive schemas