Atoms and partial orders of infinite languages
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 35, Issue: 4, page 389-401
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topKuich, Werner, and Sauer, N. W.. "Atoms and partial orders of infinite languages." RAIRO - Theoretical Informatics and Applications 35.4 (2010): 389-401. <http://eudml.org/doc/222068>.
@article{Kuich2010,
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.
},
author = {Kuich, Werner, Sauer, N. W.},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Combinatorics of words; structural Ramsey theory.; structural Ramsey theory},
language = {eng},
month = {3},
number = {4},
pages = {389-401},
publisher = {EDP Sciences},
title = {Atoms and partial orders of infinite languages},
url = {http://eudml.org/doc/222068},
volume = {35},
year = {2010},
}
TY - JOUR
AU - Kuich, Werner
AU - Sauer, N. W.
TI - Atoms and partial orders of infinite languages
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 35
IS - 4
SP - 389
EP - 401
AB -
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.
LA - eng
KW - Combinatorics of words; structural Ramsey theory.; structural Ramsey theory
UR - http://eudml.org/doc/222068
ER -
References
top- A. de Luca and St. Varrichio, Finiteness and Regularity in Semigroups and Formal Languages. Springer (1999).
- H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton (1981).
- M. Pouzet and N. Sauer, Edge partitions of the Rado graph. Combinatorica16 (1996) 1-16.
- F.P. Ramsey, On a problem of formal logic.Proc. London Math. Soc.30 (1930) 264-286.
- N. Sauer, Coloring finite substructures of countable structures. The Mathematics of Paul Erdos, X. Bolyai Mathematical Society (to appear).
- S. Yu, Regular Languages. In: Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa, Springer (1997).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.