- Email: [email protected]
DPDA's in “atomic normal form” and applications to equivalence problems
Theoretical ComlputerScience 17’ (1982) 111 North-Holland
Publishing Company
DPDA’s iin66Atomic Normal Form” and rp;pRkatPorns to equivalence pro H. Galtier, l%eor&aE Computer S’cientre 14 (198l)l 155-186
spJean
The following inaccuracies should be noted. All proofs and other results remain unaffected. (1) In Lemma 2.2, page 158, replace “the free continuous Z-algebra over X” by “the initial continuous Z-algebra” and “fre:e complete magma” by “initial complete magma”. (2) Page 160, line 12, replace “the free continuous X-algebra” :by “the initial continuous Z-algebra”. (3) Theorem 3.2 (page 163) is incompletely stated and should read as Theorem 3.2. For etie,ryterminal function symbol f occurring in a proper scheme tx, the address language L(f) is accepted by final state by a deterministicpushdown automa ton. For a variable x, L(x) is accepted by final stateand empty store by a determ(iasistic pushdown automaton.
Publishing Company
DPDA’s iin66Atomic Normal Form” and rp;pRkatPorns to equivalence pro H. Galtier, l%eor&aE Computer S’cientre 14 (198l)l 155-186
spJean
The following inaccuracies should be noted. All proofs and other results remain unaffected. (1) In Lemma 2.2, page 158, replace “the free continuous Z-algebra over X” by “the initial continuous Z-algebra” and “fre:e complete magma” by “initial complete magma”. (2) Page 160, line 12, replace “the free continuous X-algebra” :by “the initial continuous Z-algebra”. (3) Theorem 3.2 (page 163) is incompletely stated and should read as Theorem 3.2. For etie,ryterminal function symbol f occurring in a proper scheme tx, the address language L(f) is accepted by final state by a deterministicpushdown automa ton. For a variable x, L(x) is accepted by final stateand empty store by a determ(iasistic pushdown automaton.