The complexity of the label-splitting-problem for flip-flop-nets

DOI10.1007/978-3-030-61739-4_10MaRDI QIDQ2039970zbMATH OpenOpenAlexFDO

Authors Ronny Tredup

Publication date 6 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-61739-4_10

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

This page was built for publication: The complexity of the label-splitting-problem for flip-flop-nets

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