On the word problem for free products of semigroups and monoids
From MaRDI portal
Publication:2693366
DOI10.1016/j.jalgebra.2023.02.007OpenAlexW4320718947MaRDI QIDQ2693366
Publication date: 20 March 2023
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.10665
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ On the word problem for weakly compressible monoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Word problem languages for free inverse monoids
- Groups, the theory of ends, and context-free languages
- Automaton semigroups
- Hierarchies of hyper-AFLs
- The accessibility of finitely presented groups
- Monadic Thue systems
- Group presentations, formal languages and characterizations of one- counter groups
- Notion de demi-bande. Demi-bandes de type deux
- The identities of the free product of two trivial semigroups
- Non-finitely generated maximal subgroups of context-free monoids
- On the word problem for special monoids
- Groups whose word problems are not semilinear
- Context-free word problem semigroups
- Semigroups with a Context-Free Word Problem
- Regular Homeomorphisms of Finite Order on Countable Spaces
- The word problem for one-relator semigroups
- Some one-relator semigroup presentations with solvable word problems
- Confluent and Other Types of Thue Systems
- On a subclass of context-free groups
- ON SUBSEMIGROUPS AND IDEALS IN FREE PRODUCTS OF SEMIGROUPS
- Word hyperbolic semigroups
- Semigroup and Group Presentations
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- Indexed Grammars—An Extension of Context-Free Grammars
- Full AFLs and nested iterated substitution
- Some Remarks on Semigroup Presentations
- A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
