The following pages link to (Q3993363):
Displayed 22 items.
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Unification in partially commutative semigroups (Q1337561) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Category-based modularisation for equational logic programming (Q1901708) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Determinisation of Relational Substitutions in Ordered Categories with Domain (Q3498418) (← links)