Definability in the homomorphic quasiorder of finite labeled forests

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that for any k ≥ 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowed as parameters. As corollaries, we show that the structure is atomic and characterize the automorphism group of the structure. Similar results hold true for two other relevant structures: the homomorphic quasiorder of finite k-labeled trees, and of finite k-labeled trees with a fixed label of the root element. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kudinov, O. V., & Selivanov, V. L. (2007). Definability in the homomorphic quasiorder of finite labeled forests. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 436–445). https://doi.org/10.1007/978-3-540-73001-9_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free