scientific article
From MaRDI portal
Publication:3993363
zbMath1109.68521MaRDI QIDQ3993363
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Unification in partially commutative semigroups ⋮ Rabin tree automata and finite monoids ⋮ Alternating two-way AC-tree automata ⋮ Open problems in rewriting ⋮ Equational and membership constraints for infinite trees ⋮ Buchberger's algorithm: The term rewriter's point of view ⋮ The monadic second-order logic of graphs. I: Recognizable sets of finite graphs ⋮ Category-based modularisation for equational logic programming ⋮ Determinisation of relational substitutions in ordered categories with domain ⋮ Equality and disequality constraints on direct subterms in tree automata ⋮ Determinisation of Relational Substitutions in Ordered Categories with Domain ⋮ Quick specifications for the busy programmer ⋮ Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ The word problem for one-relation monoids: a survey ⋮ Observational structures and their logic ⋮ Discriminator varieties and symbolic computation ⋮ Solving divergence in Knuth--Bendix completion by enriching signatures ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ AC-unification race: The system solving approach, implementation and benchmarks ⋮ Recursively indefinite databases ⋮ Citius altius fortius ⋮ Shallow confluence of conditional term rewriting systems ⋮ Completion for rewriting modulo a congruence ⋮ Recursive queries and context-free graph grammars ⋮ Series-parallel languages and the bounded-width property ⋮ On the algebraic structure of declarative programming languages ⋮ Swinging types=functions+relations+transition systems ⋮ Decidability and complexity of simultaneous rigid E-unification with one variable and related results ⋮ Uniform and nonuniform recognizability. ⋮ A comprehensive framework for saturation theorem proving ⋮ Deductive and inductive synthesis of equational programs
