Login / Signup

The Equivalence Problem for t-Turn DPDA Is Co-NP.

Géraud Sénizergues
Published in: ICALP (2003)
Keyphrases
  • computational complexity
  • np complete
  • artificial intelligence
  • knowledge base
  • image processing
  • search algorithm
  • evolutionary algorithm
  • double exponential