arXiv cs/07021362007-02-23cs.CCcs.DM

Essential Inputs and Minimal Tree Automata

Ivo Damyanov, Slavcho Shtrakov

备注：: 7 pages, 1 figure, Sixth International Conference on Discrete Mathematics and Applications, 31.08-02.09.2001, Bansko
发表信息：: Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 77-85 p

英文摘要：

We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are shown.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Tree Automata and Essential Input Variables

We introduce and study the essential inputs (variables) for terms (trees) and tree automata.

2007-02-22cs.CCcs.DM

Tree Automata and Essential Subtrees

We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

2007-02-23cs.CCcs.DM

Tree automata and separable sets of input variables

We consider the computational complexity of tree transducers, depending on their separable sets of input variables.

2007-02-22cs.CCcs.DM

Topological properties of cellular automata on trees

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

2012-08-14cs.CCcs.DMcs.FL

Residual Finite Tree Automata

Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization of regular tree languages. In the top-down case, we obtain a subclass of regular tree languages which contains the class of languages recognized by deterministic top-down tree automata. RFTA also come wi…

2006-09-05cs.CCcs.LO

Hyper-Minimization for Deterministic Weighted Tree Automata

Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided. The presence of weights slightly complicates the situation in comparison to the unweighted case. In addition, the first hyper-minimization algorithm for deterministic weighted tree automata, weighted over commutative semifields, is provided together with some implementation remarks that enable an efficient implementation. In fact, the same run-time O(m log n) as in the unweighted case is obtained, where m is the s…

2014-05-22cs.CCcs.DScs.FL

更多相关论文收起更多论文

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree automata (WFTA) and a specific class of tree homomorphism. We show that the class of series recognized by weighted alternating automata is closed under inverses of homomorphisms, but not under homomorphisms. We give a logical characterization of weighted alternating automata, which uses weighted MSO logic for trees. Finally we investigate the strong connectio…

2021-09-17cs.CCcs.FL

用Transformer模拟序列和树上的加权自动机

Simulating Weighted Automata over Sequences and Trees with Transformers

Mila（米拉人工智能研究所）；DIRO（蒙特利尔大学计算机科学与运筹学系）；McGill University（麦吉尔大学）；Université de Montréal（蒙特利尔大学）

本研究证明Transformer能模拟加权有限自动机（WFA）和加权树自动机（WTA），给出模型规模上界，并通过合成实验验证其可经梯度训练学习，扩展了Transformer的推理能力。

2024-03-12cs.AIcs.CCcs.CL

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and Stephan (2017): play summaries, progress measures and register games. We argue that all those techniques can be viewed as instances of the separation approach to solving parity games, a key technical component of which is constructing (explicitly or implicitly) an automaton that separates languages of words encoding plays that are (decisively) won by either of the two players. Our main technical result is a quasi-polyn…

2018-11-02cs.CCcs.FLcs.GT