On a weaker notion of controllability of a language K with respect to a language L

DOI10.1109/9.237665zbMath0787.93014OpenAlexW1974650588MaRDI QIDQ3143016

Ramavarapu S. Sreenivas

Publication date: 15 May 1994

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.237665

zbMATH Keywords

discrete event dynamic systemsprefix-closed language

Mathematics Subject Classification ID

Observability (93B07)

Related Items

A note on controllability of deterministic context-free~systems ⋮ Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively