An algorithm to minimize representations of finite order relations
type: Item
instance of: scholarly article
title: An algorithm to minimize representations of finite order relations
zbMATH Open document ID: 0784.68069
DOI: 10.1080/00207169208804034
author: Camino R. Vela
author: Antonio Bahamonde
published in: International Journal of Computer Mathematics
publication date: 1992-06-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 35164
zbMATH Keywords: automata
zbMATH Keywords: minimal realization
zbMATH Keywords: order relations
zbMATH Keywords: representation
zbMATH Keywords: scoop minimization
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/00207169208804034
OpenAlex ID: W1995156723
cites work: Machines in a Category: An Expository Introduction
cites work: Fuzzy machines in a category
cites work: Cost functors and optimal realization
cites work: Q4123496
Recommended article: On optimal approximations of arbitrary relations by partial orders
Recommended article: Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
Recommended article: The best nondeterministic representations of finite orderings.
Recommended article: AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
Recommended article: An Approximate Minimum Degree Ordering Algorithm
Recommended article: Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
Recommended article: Approximations of arbitrary relations by partial orders
Recommended article: Computing minimal extending sets by relation-algebraic modeling and development
Recommended article: Q3533418
Recommended article: Q5480635
description: scientific article; zbMATH DE number 35164