Just like we can represent a mathematical expression uniquely with a binary expression tree, I was wondering if we could do the same for LTL formulae? Such that no two different looking LTL formula will have a same in order traversal.

  • 1
    $\begingroup$ An LTL formula is also a mathematical expression. $\endgroup$ Commented Mar 23, 2021 at 19:26
  • 1
    $\begingroup$ Are you familiar with context-free grammars and parse trees? $\endgroup$ Commented Mar 23, 2021 at 19:26
  • $\begingroup$ Yes. I think it can be. I just wanted to confirm. $\endgroup$ Commented Mar 23, 2021 at 20:25


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.