A finite word poset

zbMath0994.06002MaRDI QIDQ5942562

Péter L. Erdős, David C. Torney, Peter Sziklai

Publication date: 16 October 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122038

zbMATH Keywords

automorphismsposet of finite sequenceswords of length at most \(n\)

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorics of partially ordered sets (06A07) Free lattices, projective lattices, word problems (06B25)

Related Items (3)

On the Dedekind-MacNeille completion and formal concept analysis based on multilattices ⋮ Finitary coalgebraic multisemilattices and multilattices. ⋮ Automorphisms of subword-posets

This page was built for publication: A finite word poset