Bottom-up rewriting for words and terms (Q741256): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3786001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some extended word problems defined by cancellation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree generating regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite derivation type implies the homological finiteness condition \(FP_ 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable call-by-need computations in term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-Up Rewriting Is Inverse Recognizability Preserving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up rewriting for words and terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Match-bounded string rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable approximations of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rational subset problem for groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) / rank
 
Normal rank
Property / cites work
 
Property / cites work: RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability for left-linear growing term rewriting systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata for rewrite strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3559957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank

Revision as of 01:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Bottom-up rewriting for words and terms
scientific article

    Statements

    Bottom-up rewriting for words and terms (English)
    0 references
    11 September 2014
    0 references
    term rewriting systems
    0 references
    semi-Thue systems
    0 references
    regularity preservation
    0 references
    accessibility problem
    0 references
    0 references
    0 references

    Identifiers