Termination modulo equations by abstract commutation with an application to iteration (Q1391793): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / cites work
 
Property / cites work: An equational axiomatization for multi-exit iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizing prefix iteration with silent steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative-commutative reduction orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination orderings for associative-commutative rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4727412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination by completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process algebra for synchronous communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path orderings for termination of associative-commutative rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total termination of term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dummy elimination in equational rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dummy elimination: Making termination easier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete equational axiomatization for prefix iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete inference system for a class of regular behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting: Interpretation and type elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete characterization of termination of 0p 1q→1r 0s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving associative path orderings / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)00254-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978137006 / rank
 
Normal rank

Latest revision as of 09:58, 4 December 2024

scientific article
Language Label Description Also known as
English
Termination modulo equations by abstract commutation with an application to iteration
scientific article

    Statements

    Termination modulo equations by abstract commutation with an application to iteration (English)
    0 references
    0 references
    0 references
    23 July 1998
    0 references
    term rewriting
    0 references
    process algebra
    0 references

    Identifiers