Low power assignment of partial states of a parallel automaton

DOI10.17223/20710410/56/7MaRDI QIDQ5089861zbMATH OpenOpenAlexFDO

Authors Ju. V. Pottosin

Publication date 15 July 2022

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm772

zbMATH Keywords

complete bipartite sub-graphparallel automatonpartial statestate assignmentweighted cover problem

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 647673
• scientific article; zbMATH DE number 1751911
• scientific article; zbMATH DE number 1751917
• scientific article; zbMATH DE number 3890738
• Sequential algorithm for low-power encoding internal states of finite state machines

Cited in

(1)

• Decomposition of a parallel automaton into a net of sequential automata

This page was built for publication: Low power assignment of partial states of a parallel automaton

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