A Note on Deciding Controllability in Pushdown Systems

DOI10.1109/TAC.2005.863513zbMATH Open1366.93052OpenAlexW2116034587MaRDI QIDQ5281765FDOQ5281765

Authors: 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

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

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281765)