In an asynchronous cooperative editing workflow of a structured document, each of the co-authors receives in the different phases of the editing process, a copy of the document to insert its contribution. For confidentiality reasons, this copy may be only a partial replica containing only parts of the (global) document which are of demonstrated interest for the considered co-author. Note that some parts may be a demonstrated interest over a co-author; they will therefore be accessible concurrently. When it's synchronization time (e.g. at the end of an asynchronous editing phase of the process), we want to merge all contributions of all authors in a single document. Due to the asynchronism of edition and to the potential existence of the document parts offering concurrent access, conflicts may arise and make partial replicas unmergeable in their entirety: they are inconsistent, meaning that they contain conflictual parts. The purpose of this paper is to propose a merging approach said by consensus of such partial replicas using tree automata. Specifically, from the partial replicas updates, we build a tree automaton that accepts exactly the consensus documents. These documents are the maximum prefixes containing no conflict of partial replicas merged.

中文翻译：

---

用于从结构化文档的部分副本中提取共识的树自动机

在结构化文档的异步协作编辑工作流中，每个共同作者在编辑过程的不同阶段接收文档的副本以插入其贡献。出于保密原因，该副本可能只是部分副本，其中仅包含所考虑的共同作者感兴趣的（全球）文档部分。请注意，某些部分可能表现出对共同作者的兴趣；因此，它们将可以同时访问。当到了同步时间时（例如，在流程的异步编辑阶段结束时），我们希望将所有作者的所有贡献合并到一个文档中。由于版本的异步性以及提供并发访问的文档部分的潜在存在，可能会出现冲突并使部分副本在整体上无法合并：它们不一致，这意味着它们包含冲突的部分。本文的目的是提出一种通过使用树自动机对此类部分副本达成共识的合并方法。具体来说，根据部分副本更新，我们构建了一个完全接受共识文档的树自动机。这些文档是包含合并的部分副本不冲突的最大前缀。