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

DOI10.1007/978-81-322-2488-4_1MaRDI QIDQ3449708zbMATH OpenOpenAlexFDO

Authors Emanuele Rodaro, A. Cherubini

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

zbMATH Keywords

inverse semigroupsamalgamated free productsword problemSchü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)

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

Cites work

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

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
• Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions
• On the decidability of the word problem for amalgamated free products of inverse semigroups.
• scientific article; zbMATH DE number 1560312 (Why is no real title available?)
• 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)