Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
TheoretiCS · 2024
DOI: 10.46298/theoretics.24.13 ↗Kurz gefasst
Fachartikel in der Zeitschrift TheoretiCS, 2024. Verfasst von Mikołaj Bojańczyk und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Bojańczyk, M., Fijalkow, J., Klin, B., & Moerman, J. (2024). Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. TheoretiCS. https://doi.org/10.46298/theoretics.24.13
Vancouver
Bojańczyk M, Fijalkow J, Klin B, Moerman J. Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. TheoretiCS. 2024. doi:10.46298/theoretics.24.13
BibTeX
@article{Bojaczyk2024,
author = {Bojańczyk, Mikołaj and Fijalkow, Joanna and Klin, Bartek and Moerman, Joshua},
title = {Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata},
journal = {TheoretiCS},
year = {2024},
doi = {10.46298/theoretics.24.13}
}
EUVIMED