✦ LIBER ✦

Recognizable subsets of the two letter plactic monoid

✍ Scribed by A. Arnold; M. Kanta; D. Krob

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 554 KB
Volume: 64
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00157-9

No coin nor oath required. For personal study only.

✦ Synopsis

The plactic monoid %(a, b) on two letters will be studied from the point of view of classical language theory. In particular, we will give the fine structure of its recognizable subsets. @ 1997 Elsevier Science B.V.

📜 SIMILAR VOLUMES

Recognizable subsets of some partially a

Recognizable subsets of some partially abelian monoids

✍ Robert Cori; Yves Métivier 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 642 KB

On recognizable subsets of free partiall

On recognizable subsets of free partially commutative monoids

✍ Y. Metivier 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Two theorems concerning recognizable N-s

Two theorems concerning recognizable N-subsets of σ∗

✍ Juhani Karhumäki 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 776 KB

On the rank of the subsets of a free mon

On the rank of the subsets of a free monoid

✍ Jean Néraud 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 568 KB

On the decidability of some problems abo

On the decidability of some problems about rational subsets of free partially commutative monoids

✍ Alan Gibbons; Wojciech Rytter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Two techniques in the area of the star p

Two techniques in the area of the star problem in trace monoids

✍ Daniel Kirsten; Jerzy Marcinkowski 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 565 KB

This paper deals with decision problems related to the star problem in trace monoids which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme (in: I.