Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

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 t...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors: Bojanczyk, Mikolaj, Klin, Bartek, Moerman, Joshua
Format: Conference Proceeding
Language:English
Published: IEEE 29.06.2021
Subjects:
Automata
Complexity theory
Computer science
Orbits
Registers
Space vehicles
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/LICS52264.2021.9470634