Infinite normal forms for non-linear term rewriting systems (Q672235): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4890709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite, rewrite, rewrite, rewrite, rewrite, \dots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting strategy to verify observational congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding observational congruence of finite-state CCS expressions by rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite reductions in orthogonal term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete axiomatisation for observational congruence of finite-state behaviours / rank
 
Normal rank

Latest revision as of 11:16, 27 May 2024

scientific article
Language Label Description Also known as
English
Infinite normal forms for non-linear term rewriting systems
scientific article

    Statements