Publication | Closed Access

The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine

Computational Complexity TheoryEngineeringOne-counter MachineFormal MethodsComputational ComplexityEquivalence CheckingComputer ScienceDiscrete MathematicsFinite-state SystemFormal VerificationEquivalence Problem