Vaginismus 发表于 2025-4-1 03:13:41
Z-Automata for Compact and Direct Representation of Unranked Tree Languagestree languages, called Z-automaton, that is tailored for this particular application. The Z-automaton offers a compact form of representation, and unlike the closely related notion of stepwise automata, does not require a binary encoding of its input. We establish an arc-factored normal form, and prOpponent 发表于 2025-4-1 07:45:11
http://reply.papertrans.cn/47/4626/462528/462528_62.png