The parametric complexity of bisimulation equivalence of normed pushdown automata

Wenbo Zhang. The parametric complexity of bisimulation equivalence of normed pushdown automata. Frontiers of Computer Science in China, 16(4):164405, 2022. [doi]

@article{Zhang22a,
  title = {The parametric complexity of bisimulation equivalence of normed pushdown automata},
  author = {Wenbo Zhang},
  year = {2022},
  doi = {10.1007/s11704-021-0340-x},
  url = {https://doi.org/10.1007/s11704-021-0340-x},
  researchr = {https://researchr.org/publication/Zhang22a},
  cites = {0},
  citedby = {0},
  journal = {Frontiers of Computer Science in China},
  volume = {16},
  number = {4},
  pages = {164405},
}