Modeling concurrency with partial orders
International Journal of Parallel Programming
The equational theory of pomsets
Theoretical Computer Science
Free shuffle algebras in language varieties
Theoretical Computer Science
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
Theory of Computing Systems
Universal partial order represented by means of oriented trees and other simple graphs
European Journal of Combinatorics
Undecidability in the homomorphic quasiorder of finite labeled forests
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
European Journal of Combinatorics
Undecidability in Weihrauch degrees
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Complexity issues for preorders on finite labeled forests
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
| Hi-index | 0.00 |
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of finite k-posets is shown to be a distributive lattice. Homomorphicity orders of finite k-posets and k-lattices are shown to be universal in the sense that every countable poset can be embedded into them. Labeled posets are represented by directed graphs, and a categorical isomorphism between k-posets and their digraph representations is established.