Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1999.2812 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036844537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some algorithmic problems for finitely defined commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Polynomial Ideals and Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible orders and linear forms / rank
 
Normal rank

Latest revision as of 10:08, 5 June 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
scientific article

    Statements

    Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (English)
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    decision procedures
    0 references
    uniform word problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references