66 research outputs found
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton
Computing solution space properties of combinatorial optimization problems via generic tensor networks
We introduce a unified framework to compute the solution space properties of
a broad class of combinatorial optimization problems. These properties include
finding one of the optimum solutions, counting the number of solutions of a
given size, and enumeration and sampling of solutions of a given size. Using
the independent set problem as an example, we show how all these solution space
properties can be computed in the unified approach of generic tensor networks.
We demonstrate the versatility of this computational tool by applying it to
several examples, including computing the entropy constant for hardcore lattice
gases, studying the overlap gap properties, and analyzing the performance of
quantum and classical algorithms for finding maximum independent sets.Comment: Github repo:
https://github.com/QuEraComputing/GenericTensorNetworks.j
Ranked Enumeration of MSO Logic on Words
In the last years, enumeration algorithms with bounded delay have attracted a lot of attention for several data management tasks. Given a query and the data, the task is to preprocess the data and then enumerate all the answers to the query one by one and without repetitions. This enumeration scheme is typically useful when the solutions are treated on the fly or when we want to stop the enumeration once the pertinent solutions have been found. However, with the current schemes, there is no restriction on the order how the solutions are given and this order usually depends on the techniques used and not on the relevance for the user.
In this paper we study the enumeration of monadic second order logic (MSO) over words when the solutions are ranked. We present a framework based on MSO cost functions that allows to express MSO formulae on words with a cost associated with each solution. We then demonstrate the generality of our framework which subsumes, for instance, document spanners and adds ranking to them. The main technical result of the paper is an algorithm for enumerating all the solutions of formulae in increasing order of cost efficiently, namely, with a linear preprocessing phase and logarithmic delay between solutions. The novelty of this algorithm is based on using functional data structures, in particular, by extending functional Brodal queues to suit with the ranked enumeration of MSO on words
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton
Solving the Weighted HOM-Problem With the Help of Unambiguity
The HOM-problem, which asks whether the image of a regular tree language
under a tree homomorphism is again regular, is known to be decidable by [Godoy,
Gim\'enez, Ramos, \`Alvarez: The HOM problem is decidable. STOC (2010)].
Research on the weighted version of this problem, however, is still in its
infancy since it requires customized investigations. In this paper we address
the weighted HOM-problem and strive to keep the underlying semiring as general
as possible. In return, we restrict the input: We require the tree homomorphism
h to be tetris-free, a condition weaker than injectivity, and for the given
weighted tree automaton, we propose an ambiguity notion with respect to h.
These assumptions suffice to ensure decidability of the thus restricted
HOM-problem for all zero-sum free semirings by allowing us to reduce it to the
(decidable) unweighted case.Comment: In Proceedings AFL 2023, arXiv:2309.0112
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
We study ranked enumeration of join-query results according to very general
orders defined by selective dioids. Our main contribution is a framework for
ranked enumeration over a class of dynamic programming problems that
generalizes seemingly different problems that had been studied in isolation. To
this end, we extend classic algorithms that find the k-shortest paths in a
weighted graph. For full conjunctive queries, including cyclic ones, our
approach is optimal in terms of the time to return the top result and the delay
between results. These optimality properties are derived for the widely used
notion of data complexity, which treats query size as a constant. By performing
a careful cost analysis, we are able to uncover a previously unknown tradeoff
between two incomparable enumeration approaches: one has lower complexity when
the number of returned results is small, the other when the number is very
large. We theoretically and empirically demonstrate the superiority of our
techniques over batch algorithms, which produce the full result and then sort
it. Our technique is not only faster for returning the first few results, but
on some inputs beats the batch algorithm even when all results are produced.Comment: 50 pages, 19 figure
Two characterisation results of multiple context-free grammars and their application to parsing
In the first part of this thesis, a Chomsky-SchĂŒtzenberger characterisation and an automaton characterisation of multiple context-free grammars are proved. Furthermore, a framework for approximation of automata with storage is described. The second part develops each of the three theoretical results into a parsing algorithm
- âŠ