Pumping, cleaning and symbolic constraints solving (Q4632446): 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.1007/3-540-58201-0_88 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1564330433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and disequality constraints on direct subterms in tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowing based procedures for equational disunification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic proofs by induction in theories without constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficient-completeness and related properties of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the ground (co-)reducibility property in term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic confluence tests and completion methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282530 / rank
 
Normal rank

Latest revision as of 01:54, 19 July 2024

scientific article; zbMATH DE number 7048694
Language Label Description Also known as
English
Pumping, cleaning and symbolic constraints solving
scientific article; zbMATH DE number 7048694

    Statements

    Pumping, cleaning and symbolic constraints solving (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2019
    0 references
    function symbol
    0 references
    temporary leaf
    0 references
    close equality
    0 references
    ground term
    0 references
    tree automaton
    0 references

    Identifiers