Decidability versus undecidability of the word problem in amalgams of inverse semigroups.

DOI10.1007/978-81-322-2488-4_1zbMATH Open1334.20046OpenAlexW1150973757MaRDI QIDQ3449708FDOQ3449708

Publication date: 5 November 2015

Published in: Semigroups, Algebras and Operator Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2488-4_1

Recommendations

Amalgams of finite inverse semigroups.
On the decidability of the word problem for amalgamated free products of inverse semigroups.
Amalgams of free inverse semigroups.
Amalgams of inverse semigroups and reversible two-counter machines.
Normal forms for semigroup amalgams

zbMATH Keywords

inverse semigroups amalgamated free products word problem Schützenberger automata

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18)

Cites Work

Title not available (Why is that?)
Logical Reversibility of Computation
Groupoids, inverse semigroups, and their operator algebras
Title not available (Why is that?)
The local structure of tilings and their integer group of coinvariants
Amalgams of finite inverse semigroups.
Amalgams of inverse semigroups and reversible two-counter machines.
The word problem for HNN-extensions of free inverse semigroups
Amalgams vs Yamamura's HNN-extensions of inverse semigroups.
Free products of inverse semigroups II
Presentations of inverse monoids
Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
A topological approach to inverse and regular semigroups.
Topological equivalence of tilings
Note on idempotent semigroups, I
Algorithmic problems for amalgams of finite semigroups
Bass-Serre theory for groupoids and the structure of full regular semigroup amalgams
Title not available (Why is that?)
Amalgamated free products of inverse semigroups
Amalgamated free products of inverse semigroups
Amalgams of free inverse semigroups.
On the Structure of Inverse Semigroup Amalgams
Title not available (Why is that?)
Universality of a reversible two-counter machine
Maximal subgroups of amalgams of finite inverse semigroups.
Amalgams of finite inverse semigroups and deterministic context-free languages.
MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
Bicyclic subsemigroups in amalgams of finite inverse semigroups.
On the decidability of the word problem for amalgamated free products of inverse semigroups.

Cited In (12)

An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core
Free products of inverse semigroups II
Amalgams of finite inverse semigroups and deterministic context-free languages.
Undecidability of the word problem for Yamamura's HNN-extension under nice conditions.
Normal forms for semigroup amalgams
On the decidability of the word problem for amalgamated free products of inverse semigroups.
Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions
Title not available (Why is that?)
Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
A survey of recent results in groups and orderings: word problems, embeddings and amalgamations
Amalgams of inverse semigroups and reversible two-counter machines.

This page was built for publication: Decidability versus undecidability of the word problem in amalgams of inverse semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449708)