Abstract: Discrete-time linear systems are a ubiquitous modeling tool across the sciences. We study a reachability problem related to discrete-time linear systems which we call ``Affine Subspace Reachability Problem''.
Groebner basis for a multivariate polynomial ideal is a finite basis of polynomials that has many useful properties. Large memory requirements and computation time for most practical problems hinder the use of Groebner basis in many areas.
Machine translation has been one of the key problems in computational linguistics. An important part of the same is to get the order of words in the translated sentence correct.
