Login / Signup

Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete.

Wenbo ZhangQiang YinHuan LongXian Xu
Published in: ICALP (2020)
Keyphrases
  • equivalence relation
  • cellular automata
  • case study
  • finite state
  • machine learning
  • database
  • data sets
  • genetic algorithm
  • artificial intelligence
  • image sequences
  • markov chain
  • heuristic search