arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.02879cs.FL
收藏

基于换能器的有源XML重写博弈

Transducer-based Rewriting Games for Active XML

Martin Schuster

摘要:

上下文无关游戏是两个玩家的重写游戏,在嵌套的字符串上玩,这些字符串表示具有嵌入函数符号的XML文档。这些游戏被引入到动态XML框架中的内涵文档的重写过程中,其中输入文档将通过调用外部服务重写到给定的目标模式中。本文研究的设置,其中的依赖关系的输入和输出的服务调用的传感器,这还没有被检查以前建模。它定义了转换器模型操作嵌套的话,并研究它们的属性,以及计算复杂性的获胜问题的转换器为基础的上下文无关的游戏在几种情况下。虽然这个问题的复杂性是相当高的,在大多数情况下(从NP完全到不可判定),也确定了一些易于处理的限制。

英文摘要:

Context-free games are two-player rewriting games that are played on nested strings representing XML documents with embedded function symbols. These games were introduced to model rewriting processes for intensional documents in the Active XML framework, where input documents are to be rewritten into a given target schema by calls to external services. This paper studies the setting where dependencies between inputs and outputs of service calls are modelled by transducers, which has not been examined previously. It defines transducer models operating on nested words and studies their properties, as well as the computational complexity of the winning problem for transducer-based context-free games in several scenarios. While the complexity of this problem is quite high in most settings (ranging from NP-complete to undecidable), some tractable restrictions are also identified.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑