The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function.

DOI10.1016/S0166-218X(02)00457-2zbMath1073.68044OpenAlexW2021918284MaRDI QIDQ1410683

H. Narayanan, Sachin B. Patkar, Madhav P. Desai

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00457-2

zbMATH Keywords

PartitionsSubmodular functionsFSM decomposition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Theory of Principal Partitions Revisited

Cites Work

• The principal lattice of partitions of a submodular function
• Submodular functions and electrical networks
• Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach

This page was built for publication: The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function.