Word Problem Languages for Free Inverse Monoids - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Word Problem Languages for Free Inverse Monoids

(1)
1

Abstract

This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context-free; and that the word problem of a free inverse monoid of rank greater than 1 is not poly-context-free.
Fichier principal
Vignette du fichier
470153_1_En_3_Chapter.pdf (309.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01905631 , version 1 (26-10-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Tara Brough. Word Problem Languages for Free Inverse Monoids. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.24-36, ⟨10.1007/978-3-319-94631-3_3⟩. ⟨hal-01905631⟩
23 View
22 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More