Semigroups with a Context-Free Word Problem
From MaRDI portal
Publication:3167487
DOI10.1007/978-3-642-31653-1_10zbMATH Open1370.20057OpenAlexW2139334518MaRDI QIDQ3167487FDOQ3167487
Authors:
Publication date: 2 November 2012
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_10
Recommendations
- Context-free word problem semigroups
- scientific article; zbMATH DE number 3379206
- On the word problem for finitely-generated semigroups
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- scientific article; zbMATH DE number 459345
- Solvable word problems in semigroups
- scientific article; zbMATH DE number 679820
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
- The word problem for relatively free semigroups.
- The word problem for semigroups with one-sided cancellation
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (11)
- A language hierarchy of binary relations
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- On the word problem for special monoids
- On the word problem for free products of semigroups and monoids
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
- The loop problem for monoids and semigroups
- On the word problem for weakly compressible monoids
- McCammond’s normal forms for free aperiodic semigroups revisited
- Free products of semigroups and monoids with a deterministic context-free word problem
- Freeness problem for matrix semigroups of Parikh matrices
This page was built for publication: Semigroups with a Context-Free Word Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167487)
