M.F. Cowlishaw
IBM Systems Journal
Paper
Minimal Presentations for Irreducible Sofic Shifts
Abstract
We re-cast a theorem of Willems in terms of symbolic dynamics. We then present a new result which characterizes when an irreducible sofic shift (i.e., constrained system) has a unique minimal irreducible presentation. © 1994 IEEE
Related
David A. Selby
IBM J. Res. Dev
Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science