Unique decipherability in the monoid of languages: an application of rational relations (Q639857): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-011-9324-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991764466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON LANGUAGES FACTORIZING THE FREE MONOID / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy of finite biprefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on decidability questions on presentations of word semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4728262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of prime decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of commuting with finite sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and equations on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes conjugués / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on multiset decipherable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique decipherability in the additive monoid of sets of numbers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:08, 4 July 2024

scientific article
Language Label Description Also known as
English
Unique decipherability in the monoid of languages: an application of rational relations
scientific article

    Statements

    Unique decipherability in the monoid of languages: an application of rational relations (English)
    0 references
    0 references
    0 references
    11 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    unique decipherability
    0 references
    finite automata
    0 references
    regular languages
    0 references
    0 references