Modularity in the semilattice of \(\omega \)-words (Q2249955): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2014/891760 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2018906641 / rank | |||
Normal rank |
Revision as of 01:19, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modularity in the semilattice of \(\omega \)-words |
scientific article |
Statements
Modularity in the semilattice of \(\omega \)-words (English)
0 references
4 July 2014
0 references
Summary: A partial ordering of \(\omega \)-words can be introduced with regard to whether an \(\omega \)-word can be transformed into another by a Mealy machine. It is known that the poset of \(\omega \)-words that is introduced by this ordering is a join-semilattice. The width of this join-semilattice has the power of continuum while the depth is at least \(\aleph_0\). We have created a technique for proving that power-characteristic \(\omega \)-words are incomparable. We use this technique to show that this join-semilattice is not modular.
0 references