Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata release_z2x4rcx7xnedlcyilfa2aaaqwe

by Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman

Released as a article .

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 Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

"Dark" Preservation Only
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article
Stage   submitted
Date   2021-04-23
Version   v2
Language   en ?
arXiv  2104.02438v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f2e479ee-977c-4d23-9654-2e5d5be61e91
API URL: JSON