scientific article; zbMATH DE number 3590511
From MaRDI portal
Publication:4159542
zbMATH Open0379.20046MaRDI QIDQ4159542FDOQ4159542
Authors: Gennady S. Makanin 
Publication date: 1977
Title of this publication is not available (Why is that?)
Free semigroups, generators and relations, word problems (20M05) Algorithms in computer science (68W99) Word problems, etc. in computability and recursion theory (03D40)
Cited In (27)
- Dominance constraints in stratified context unification
- Non-structural subtype entailment in automata theory
- Unification in partially commutative semigroups
- Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups
- Finding patterns common to a set of strings
- Unification in commutative theories
- On rewrite constraints and context unification
- On equations and inequalities in words and word lengths
- Associative-commutative unification
- Unification problems with one-sided distributivity
- Discontinuities in pattern inference
- The undecidability of the second order predicate unification problem
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- Learning elementary formal systems
- A polynomial algorithm for solving systems of two linear diophantine equations
- Complete sets of unifiers and matchers in equational theories
- Coding in the existential theory of concatenation
- Complete κ-reducibility of pseudovarieties of the form DRH
- A partial solution for \(D\)-unification based on a reduction to AC1-unification
- On the satisfiability of context-free string constraints with subword-ordering
- On one-relator groups and units of special one-relation inverse monoids
- History and basic features of the critical-pair/completion procedure
- On equations in free monoids and semigroups with restrictions on solutions
- Periodicity forcing words
- Sur la détermination du rang d'une équation dans le monoide libre
- The expressibility of languages and relations by word equations
- Languages with homomorphic replacements
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159542)
