Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
release_ozivgs46yjb3dbf23crxn2l2yi
by
Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman
2021
Abstract
We develop a theory of vector spaces spanned by orbit-finite sets. Using this
theory, we give a decision procedure for equivalence of weighted register
automata, which are the common generalization of weighted automata and register
automata for infinite alphabets. The algorithm runs in exponential time, and in
polynomial time for a fixed number of registers. As a special case, we can
decide, with the same complexity, language equivalence for unambiguous register
automata, which improves previous results in three ways: (a) we allow for order
comparisons on atoms, and not just equality; (b) the complexity is
exponentially better; and (c) we allow automata with guessing.
In text/plain
format
Archived Files and Locations
application/pdf 295.7 kB
file_qmwx5qvqlretbh2pgangyp55ce
|
arxiv.org (repository) web.archive.org (webarchive) |
2104.02438v1
access all versions, variants, and formats of this works (eg, pre-prints)