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

Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman

Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review


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.

Original languageEnglish
Title of host publication2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Number of pages13
ISBN (Electronic)978-1-6654-4895-6
ISBN (Print)978-1-6654-4896-3
Publication statusPublished - 7 Jul 2021
Event36th Annual ACM/IEEE Symposium on Logic in Computer Science - Online, Rome, Italy
Duration: 29 Jun 20212 Jul 2021
Conference number: 36


Symposium36th Annual ACM/IEEE Symposium on Logic in Computer Science
Abbreviated titleLICS 2021
Internet address


Dive into the research topics of 'Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata.'. Together they form a unique fingerprint.

Cite this