Idealized Algol with ground recursion, and PDA equivalence

Andrzej Murawski (1) , Luke Ong (1) , Igor Walukiewicz (2)

1 OUCL - Computing Laboratory
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We prove that observational equivalence of IA3 + Y0 (3rd- order Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable. This completes the classifi- cation of decidable fragments of Idealized Algol. We also prove that ob- servational approximation of IA1 + Y0 is undecidable by reducing the DPDA Containment Problem to it.

Domaines: Logique en informatique [cs.LO]

Andrzej Murawski, Luke Ong, Igor Walukiewicz. Idealized Algol with ground recursion, and PDA equivalence. ICALP'05, 2005, Portugal. pp.917-926. ⟨hal-00335728⟩