Abstract
Properties of orbits in max–min algebra are described, mainly the properties of periodic orbits. An O( n 3) algorithm computing the period of a periodic orbit is presented. As a consequence, an O( n 3 log n) algorithm computing the period of arbitrary orbit is obtained, as the pre-periodic part of the orbit has length at most ( n − 1) 2 + 1.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
