L(A)=L(B)? A simplified decidability proof
We give a proof of decidability of the equivalence problem for deterministic pushdown automata, which simplifies that of Senizergues (Theoret. Comput. Sci. 251 (2000) 1). (C) 2002 Elsevier Science B.V. All rights reserved.
deterministic pushdown automata rational languages finite dimensional vector spaces matrix semi-groups complete formal systems