Free products of semigroups and monoids with a deterministic context-free word problem

DOI10.1016/J.IPL.2024.106541MaRDI QIDQ6663534

Peter Kostolányi

Publication date: 14 January 2025

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

semigroupword problemmonoidfree productdeterministic pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Groups, the theory of ends, and context-free languages
• The accessibility of finitely presented groups
• On the word problem for special monoids
• Groups with poly-context-free word problem.
• Closure properties in the class of multiple context-free groups
• Context-free word problem semigroups
• Word problems recognisable by deterministic blind monoid automata
• On the word problem for free products of semigroups and monoids
• Groups, Languages and Automata
• Semigroups with a Context-Free Word Problem
• ON GROUPS AND COUNTER AUTOMATA
• GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
• On a subclass of context-free groups
• Word hyperbolic semigroups
• Space Complexity and Word Problems of Groups
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
• Developments in Language Theory

This page was built for publication: Free products of semigroups and monoids with a deterministic context-free word problem

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