A Note on Deciding Controllability in Pushdown Systems

DOI10.1109/TAC.2005.863513zbMath1366.93052OpenAlexW2116034587MaRDI QIDQ5281765

Christopher Griffin

Publication date: 27 July 2017

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

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

Mathematics Subject Classification ID

Controllability (93B05) Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

A note on controllability of deterministic context-free~systems ⋮ Detecting Useless Transitions in Pushdown Automata ⋮ Detecting useless transitions in pushdown automata ⋮ Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively

This page was built for publication: A Note on Deciding Controllability in Pushdown Systems