A note on deciding the controllability of a language K with respect to a language L

DOI10.1109/9.250543zbMath0771.68078OpenAlexW2140191050MaRDI QIDQ5288788

Ramavarapu S. Sreenivas

Publication date: 22 August 1993

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

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

zbMATH Keywords

decidabilitycontrollability of a languagePetri net reachability problemplant automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Petri net languages and infinite subsets of \(\mathbb{N}^m\)

This page was built for publication: A note on deciding the controllability of a language K with respect to a language L