Minimal Presentations for Irreducible Sofic Shifts

Brian Marcus

doi:10.1109/18.340457

IEEE Trans. Inf. Theory

Paper

01 Jan 1994

Minimal Presentations for Irreducible Sofic Shifts

View publication

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

Conference paper

Multiple range query optimization with distributed cache indexing

Beomseok Nam, Henrique Andrade, et al.

ACM/IEEE SC 2006

Paper

Improved fairness algorithms for rings with spatial reuse

Israel Cidon, Leonidas Georgiadis, et al.

IEEE/ACM Transactions on Networking

Conference paper

Low-Resource Speech Recognition of 500-Word Vocabularies

Sabine Deligne, Ellen Eide, et al.

INTERSPEECH - Eurospeech 2001

Paper

Evolution of multiprotocol label switching

Arun Viswanathan, Nancy Feldman, et al.

IEEE Communications Magazine

View all publications

Abstract

Related

Multiple range query optimization with distributed cache indexing

Improved fairness algorithms for rings with spatial reuse

Low-Resource Speech Recognition of 500-Word Vocabularies

Evolution of multiprotocol label switching