Regular languages and partial commutations (Q391641): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2013.07.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Semigroupe / rank
 
Normal rank
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.1016/j.ic.2013.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162512015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4922474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation rewriting and algorithmic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total regulators generated by derivation relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does Partial Commutative Closure Preserve Regularity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle on positive varieties of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hereditary properties of the class of graphs with convex quadratic stability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of automata in semi-commutation verification techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4654642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the commutative closure of star-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Star Operation for Star-Free Trace Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure of group languages and open sets of the Hall topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2013.07.003 / rank
 
Normal rank

Latest revision as of 16:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Regular languages and partial commutations
scientific article

    Statements

    Regular languages and partial commutations (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    regular language
    0 references
    partial commutation
    0 references
    trace language
    0 references
    shuffle
    0 references
    variety of languages
    0 references

    Identifiers