An extended direct branching algorithm for checking equivalence of deterministic pushdown automata

This publication has 23 references indexed in Scilit:

• An axiomatic approach to the Korenjak-Hopcroft algorithms
  Theory of Computing Systems, 1983
• A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
  SIAM Journal on Computing, 1982
• The simultaneous accessibility of two configurations of two equivalent DPDA's
  Information Processing Letters, 1981
• On equivalence of grammars through transformation trees
  Theoretical Computer Science, 1979
• Superdeterministic DPDAs: The method of accepting does affect decision problems
  Journal of Computer and System Sciences, 1979
• Two decidability results for deterministic pushdown automata
  Journal of Computer and System Sciences, 1979
• A representation of trees by languages I
  Theoretical Computer Science, 1978
• An improvement on valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
  Theoretical Computer Science, 1976
• Real-Time Strict Deterministic Languages
  SIAM Journal on Computing, 1972
• Simple deterministic languages
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1966