Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
Authors:
Preprint
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- On the Complexity of Equivalence and Minimisation for Q-weighted AutomataLogical Methods in Computer Science, 2013
- Finite state machines for strings over infinite alphabetsACM Transactions on Computational Logic, 2004
- Finite-memory automataTheoretical Computer Science, 1994
- Existence of bases implies the axiom of choice1984
- Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automataInformation and Control, 1969