Equivalence of set- and bag-valued orbits

Authors:
Keijo Ruohonen
Affiliations:
Department of Mathematics, Tampere University of Technology, Tampere, Finland
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2009

Citing 5
Cited 0

Polynomial-time algorithm for the orbit problem

Journal of the ACM (JACM)
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Automata, Languages, and Machines

Automata, Languages, and Machines
Lectures on Linear Sequential Machines

Lectures on Linear Sequential Machines
The complexity of the membership problem for 2-generated commutative semigroups of rational matrices

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that to check the equivalence of two set-valued or bag-valued orbits over the rationals it suffices to verify equality of N initial terms of the orbits where N depends only on the dimension of the orbits. An explicit form for N is given.