On The Structure of Dyck Languages
Rita Gitik, Eliyahy Rips

TL;DR
This paper proves a fundamental property of Dyck languages, showing that the closure of the one-sided Dyck language in a free monoid results in a two-sided Dyck language, revealing structural insights.
Contribution
It establishes a novel theoretical connection between one-sided and two-sided Dyck languages within free monoids.
Findings
Closure of one-sided Dyck language is a two-sided Dyck language
Provides a new structural understanding of Dyck languages
Advances formal language theory
Abstract
We prove that the closure of the one-sided Dyck language in a free monoid is a two-sided Dyck language.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Geometric and Algebraic Topology
On the Structure of Dyck Languages
Rita Gitik
Department of Mathematics
University of Michigan
Ann Arbor, MI, 48109
and
Eliyahu Rips
Institute of Mathematics
Hebrew University, Jerusalem, 91904, Israel
Abstract.
We prove that the closure of the one-sided Dyck language in a free monoid is a two-sided Dyck language.
2010 Mathematics Subject Classification:
Primary: 68Q45; Secondary: 22A15, 20M05, 20M15
Keywords: Dyck Languages, Monoid, Homomorphism, Closed set.
1. Introduction
A Dyck language (cf. [1], p.27) consists of ”well-formed” words over a finite number of pairs of parentheses. The restricted or one-sided Dyck languages are formed of the words over pairs of parentheses which are ”correct” in the usual sense, i.e. in each pair of canceling brackets an opening bracket precedes the closing bracket. Thus is a word in .
For the unrestricted or two-sided Dyck languages , the interpretation of the parentheses is different. Two parentheses of the same type are considered as formal inverses for each other. A word is considered as ”correct” if and only if successive deletion of pairs of associated parentheses of the form and of the form yields the empty word. Thus is a word in .
Note that the word is a word in the two-sided Dyck language, but not in the one-sided Dyck language.
Let be a two-sided (unrestricted) Dyck language on two pairs of letters and . Denote by the corresponding one-sided (restricted) Dyck language.
Let be the free monoid on and let be the free group on the free generators . We endow with the profinite topology in which all the subgroups of finite index in are the open neighborhoods of . We consider the topology on induced by the embedding .
The main result of this paper is the following theorem.
Theorem 1**.**
The closure of in is .
2. Proof of Theorem 1
Let be the free group on the generators and . Let be the homomorphism given by , and . Then because consists of words in which reduce to when we delete the subwords , and . All such words constitute the two-sided Dyck language .
The homomorphism is continuous in the profinite topologies on and because a preimage of a subgroup of finite index in is a subgroup of finite index in . Therefore, is closed in and is closed in the induced topology on . Thus, the closure of in is a subset of .
On the other hand, let be a normal subgroup of finite index in . There exists such that . It follows that . Hence and .
Therefore , where is the subgroup of generated by in . It follows that the closure of in is a subset of the closure of in .
So . Hence, , as required.
3. Acknowledgment
The first author would like to thank the Albert Einstein Institute of Mathematics of the Hebrew University for generous support.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Berstel, Trunsductions and Context-Free Languages , Springer, Weisbaden, 1979.
