ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES (Q3056271): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic completely-simple semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation theorems on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity and commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy multiplications. I: The realm of Kleene's theorem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 3 July 2024

scientific article
Language Label Description Also known as
English
ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES
scientific article

    Statements

    ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES (English)
    0 references
    0 references
    0 references
    11 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    regular languages
    0 references
    finitely generated subsemigroups
    0 references
    monoid
    0 references
    one letter alphabet
    0 references
    Kleene
    0 references
    rational
    0 references
    automatic
    0 references