Issue Theoret. Informatics Appl. Volume 35, Number 4, July-August 2001 Page(s) 389 - 401 DOI 10.1051/ita:2001126

DOI: 10.1051/ita:2001126


Theoret. Informatics Appl. 35, 389-401 (2001)

Atoms and partial orders of infinite languages

Werner Kuich¹ and N.W. Sauer<sup>2

1</sup>  Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040 Wien, Austria; (kuich@tuwien.ac.at)
²  University of Calgary, Department of Mathematics and Statistics, 2500 University Dr. NW. Calgary Alberta Canada T2N1N4; (nsauer@math.ucalgary.ca)

(Received February 1, 2001. Accepted September 27, 2001)

Abstract
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under . This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding.

AMS Subject: 68R15, 05C55.

Key words: Combinatorics of words -- structural Ramsey theory.


© EDP Sciences 2001

What is OpenURL?