Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
Elec- tronic Proceedings in Theoretical Computer Science 266, pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.
citing papers explorer
-
Automaton-based Characterisations of First Order Logic over Infinite Trees
Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
-
Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.