arXiv 1806.082322018-06-21cs.DS

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization

Alexandru Popa, Andrei Tanasescu

备注：: 15 pages; 5 figures

英文摘要：

Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon the most popular quasi-periodicity model for strings, i.e., covers, generalizing it to trees. We introduce a new type of cover automata, which we call \textbf{D}eterministic \textbf{T}ree \textbf{A}utomata. Then, we formulate a cover problem on these DTA and study its complexity, in both sequential and parallel settings. We obtain bounds for the Cover Minimization Problem. Along the way, we uncover an interesting application, the Shortest Common Cover Problem, for which we give an optimal solution.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Minimization of Büchi Automata using Fair Simulation

We present an algorithm, which reduces the size of Büchi automata using fair simulation. Its time complexity is $\mathcal{O}(|Q|^4 \cdot |Δ|^2)$, the space complexity is $\mathcal{O}(|Q| \cdot |Δ|)$. Simulation is a common approach for minimizing $ω$-automata such as Büchi automata. Direct simulation, delayed simulation and fair simulation are different types of simulation. As we will show, minimization based on direct or delayed simulation is conceptually simple. Whereas the algorithm based on fair simulation is more complex. However, fair simulation allows a stronger minimization of the auto…

2016-03-03cs.DScs.FL

From Generic Partition Refinement to Weighted Tree Automata Minimization

Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the best known algorithms for many concrete types of systems, e.g. deterministic automata as well as ordinary, weighted, and probabilistic (labelled) transition systems. Genericity is achieved by modelling transition types as functors on sets, and systems as coalgebras. In the present work, we refine the run time analysis of our algorithm to cover addi…

2020-11-25cs.DS

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

Advanced Automata Minimization

We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances (1-3 orders of magnitude) than before. This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithm is based on new transition pruning techniques. These use criteria based on combinations of backward and forward trace inclusions. Since these re…

2012-10-24cs.DScs.FL

Extending the scalars of minimizations

In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $Σ^*$ where $Σ$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct $\K$-subsets of $Σ^*$ in the sense of Eilenberg, that are alternatively called noncommutative formal power series for which a framework very similar to language theory has been constructed Particular noncommutative formal power series, which are called rational series, are the behaviour of a family of weighted automata (or $\K$-automata). In order to get an efficient enc…

2006-07-18cs.DScs.SCmath.CO

Enumerating Cryptarithms Using Deterministic Finite Automata

A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. In this paper, we propose a method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base. We implemented the method and constructed a DFA for bases $k \le 7$. Those DFAs can be used as complete catalogues of cryptarithms,whose applications include enumeration of and counting the exact numbers $G_k(n)$ of cryptarithm instances with $n$ digits that admi…

2018-07-27cs.DScs.FL

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

Succinct Representation for (Non)Deterministic Finite Automata

Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their conceptual extension is the non-deterministic finite automata which also have plenty of applications. In this article, we study these models through the lens of succinct data structures where our ultimate goal is to encode these mathematical objects using information-theoretically optimal number of bits along with supporting queries on them efficiently. Towards this goal, we first design a succinct data structure for representing any deterministic finite automaton $\…

2019-07-22cs.DMcs.DScs.FL

An n log n Alogrithm for Deterministic Kripke Structure Minimization

We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.

2012-05-26cs.DScs.FLcs.LO