DISCRETE-TIME SYSTEMS THAT ADMIT FINITELY MANY CAUSAL STATE-REPRESENTATIONS

DOI10.1080/03081079908962088zbMath0943.93039OpenAlexW2083110622MaRDI QIDQ4265895

Toshitami Matsumoto

Publication date: 6 September 2000

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079908962088

zbMATH Keywords

automatoncausal discrete-time systemfinite observabilitystate-representations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete-time control/observation systems (93C55) Observability (93B07) Realizations from input-output data (93B15)

Cites Work

• A CHARACTERIZATION OF INTERACTIONS
• CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH

This page was built for publication: DISCRETE-TIME SYSTEMS THAT ADMIT FINITELY MANY CAUSAL STATE-REPRESENTATIONS