A note on controllability of deterministic context-free~systems

DOI10.1016/J.AUTOMATICA.2012.06.004zbMath1268.93025OpenAlexW2067744646MaRDI QIDQ2391510

Tomáš Masopust

Publication date: 31 July 2013

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0005109812002543

zbMATH Keywords

controllabilitydiscrete-event systemsdecidabilitydeterministic context-free systemsstate-space explosion problem

Mathematics Subject Classification ID

Controllability (93B05) Discrete event control/observation systems (93C65)

Related Items (1)

Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More concise representation of regular languages by automata and regular expressions
• \(L(A)=L(B)\)? decidability results from complete formal systems
• On a weaker notion of controllability of a language K with respect to a language L
• Introduction to Discrete Event Systems
• A Note on Deciding Controllability in Pushdown Systems
• A variant of a recursively unsolvable problem

This page was built for publication: A note on controllability of deterministic context-free~systems