Worst Case Bounds for Maximal Compatible Subsets

DOI10.1109/T-C.1975.224315MaRDI QIDQ4067009zbMATH OpenFDO

Authors F. Rubin

Publication date 1975

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(1)

• Minimal coverings for incompletely specified sequential machines

This page was built for publication: Worst Case Bounds for Maximal Compatible Subsets

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