2 papers
cs.IT2008
On the Period of a Periodic-Finite-Type Shift
Akiko Manada, Navin Kashyap
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of…
cs.DM2007
Matroid Pathwidth and Code Trellis Complexity
Navin Kashyap
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from…