Wreath product and infinite words (Q1587974): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126311209, #quickstatements; #temporary_batch_1719272490319
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic congruence for rational \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the matrix representation of transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126311209 / rank
 
Normal rank

Latest revision as of 01:46, 25 June 2024

scientific article
Language Label Description Also known as
English
Wreath product and infinite words
scientific article

    Statements

    Wreath product and infinite words (English)
    0 references
    0 references
    31 October 2001
    0 references
    The wreath product of semigroups is extended to \(\omega\)-semigroups in a natural way so that the ``wreath product principle'' holds in a strong form. This variant of the principle characterizes \(\omega\)-languages recognized by wreath products \(S\circ T\) of \(\omega\)-semigroups in terms of inverse images of \(\omega\)-languages recognized by the first factor \(S\) by sequential functions. The principle is applied to obtain decomposition results for pseudovarieties of \(\omega\)-semigroups associated with a pseudovariety of semigroups.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    wreath products
    0 references
    infinite words
    0 references
    languages
    0 references
    pseudovarieties
    0 references
    \(\omega\)-semigroups
    0 references
    sequential functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references