Login / Signup

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable.

Erik Paul
Published in: MFCS (2017)
Keyphrases
  • tree automata
  • np complete
  • database
  • reinforcement learning
  • data warehouse