Injective envelopes of transition systems and Ferrers languages
Combinatorics
2019-07-05 v1 Information Theory
math.IT
Abstract
We consider reflexive and involutive transition systems over an ordered alphabet equipped with an involution. We give a description of the injective envelope of any two-element set in terms of Galois lattice, from which we derive a test of its finiteness. Our description leads to the notion of Ferrers language.
Keywords
Cite
@article{arxiv.1907.02231,
title = {Injective envelopes of transition systems and Ferrers languages},
author = {Mustapha Kabil and Maurice Pouzet},
journal= {arXiv preprint arXiv:1907.02231},
year = {2019}
}
Comments
23 pages