State assignment based on two-dimensional placement and hypercube mapping

DOI10.1016/S0167-9260(97)00027-8zbMATH Open0909.68004OpenAlexW1995501342WikidataQ127216958 ScholiaQ127216958MaRDI QIDQ4224364

Author name not available (Why is that?)

Publication date: 12 January 1999

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9260(97)00027-8

zbMATH Keywords

hypercubedilationgraph embeddingstate assignmentplacementfinite-state machine

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (1)

HARD: A hypercube embedding algorithm for state assignment of finite state machines

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• HARD: A hypercube embedding algorithm for state assignment of finite state machines 👍 👎
• Using state diagrams for hilbert curve mappings 👍 👎
• A projection-based solution to the SP(2N) state labeling problem 👍 👎
• Zero placement and squaring problem: a state space approach 👍 👎
• State Space Realization of 2-D Finite-Dimensional Behaviours 👍 👎
• Twofold state assignment for the Moore finite state machines 👍 👎

This page was built for publication: State assignment based on two-dimensional placement and hypercube mapping

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