Graph unification and matching (Q4645268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient incremental algorithm for solving systems of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the second-order unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal and complete word unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification: a multidisciplinary survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word unification and transformation of generalized equations / rank
 
Normal rank

Latest revision as of 19:33, 17 July 2024

scientific article; zbMATH DE number 6999571
Language Label Description Also known as
English
Graph unification and matching
scientific article; zbMATH DE number 6999571

    Statements

    Identifiers