On The Structure of Dyck Languages
Formal Languages and Automata Theory
2019-07-12 v1
Abstract
We prove that the closure of the one-sided Dyck language in a free monoid is a two-sided Dyck language.
Cite
@article{arxiv.1907.05368,
title = {On The Structure of Dyck Languages},
author = {Rita Gitik and Eliyahy Rips},
journal= {arXiv preprint arXiv:1907.05368},
year = {2019}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Linear Context-Free Tree Languages and Inverse Homomorphisms
Johannes Osterholzer, Toni Dietze, Luisa Herrmann
2015-10-20
Formal Languages and Automata Theory · Computer Science
Finite Orbits of Language Operations
E. Charlier, M. Domaratzki, T. Harju, J. Shallit
2011-03-02
Formal Languages and Automata Theory · Computer Science
The degree of a finite set of words
Dominique Perrin, Andrew Ryzhikov
2022-07-28
Formal Languages and Automata Theory · Computer Science
On Some Complexity Results for Even Linear Languages
Liliana Cojocaru
2024-01-26
Formal Languages and Automata Theory · Computer Science
A Language Hierarchy of Binary Relations
Tara Brough, Alan J. Cain
2018-12-06
Formal Languages and Automata Theory · Computer Science
Two-dimensional Dyck words
Stefano Crespi Reghizzi, Antonio Restivo, Pierluigi San Pietro
2023-09-22
Group Theory · Mathematics
On periodic points of free inverse monoid endomorphisms
Emanuele Rodaro, Pedro V. Silva
2014-02-07
Logic in Computer Science · Computer Science
Syntactic Monoids in a Category
Jiri Adamek, Stefan Milius, Henning Urbat
2015-06-17
Logic · Mathematics
The pseudofinite monadic second order theory of words
Deacon Linkhorn
2022-03-14
Logic in Computer Science · Computer Science
A Categorical Approach to Syntactic Monoids
Jiří Adamek, Stefan Milius, Henning Urbat
2023-06-22
Group Theory · Mathematics
Free inverse monoids are co-context-free
Tara Macalister Brough, Marianne Johnson, Mark Kambites, Carl-Fredrik Nyberg-Brodda
2025-11-04
Group Theory · Mathematics
Word Problem Languages for Free Inverse Monoids
Tara Brough
2018-03-22
Logic in Computer Science · Computer Science
Monadic Monadic Second Order Logic
Mikołaj Bojańczyk, Bartek Klin, Julian Salamanca
2022-01-26
Logic · Mathematics
Ordered Monoids: Languages and Relations
Szabolcs Mikulas
2017-04-06
Group Theory · Mathematics
Context-free rewriting systems and word-hyperbolic structures with uniqueness
Alan J. Cain, Victor Maltcev
2015-10-21
Formal Languages and Automata Theory · Computer Science
Dyck-based characterizations of Indexed Languages
Severine Fratani, El Makki Voundy
2015-11-11
Group Theory · Mathematics
On the Word Problem for Free Products of Semigroups and Monoids
Carl-Fredrik Nyberg-Brodda
2021-12-21
Group Theory · Mathematics
On the Word Problem for Compressible Monoids
Carl-Fredrik Nyberg-Brodda
2022-02-08
Formal Languages and Automata Theory · Computer Science
Pro-aperiodic monoids via saturated models
Samuel J. v. Gool, Benjamin Steinberg
2017-08-30
Group Theory · Mathematics
Closure Properties in the Class of Multiple Context Free Groups
Robert P. Kropholler, Davide Spriano
2019-01-14
Formal Languages and Automata Theory · Computer Science
Semidirect Product Decompositions for Periodic Regular Languages
Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki
2024-03-11
Programming Languages · Computer Science
Logical Relations for Partial Features and Automatic Differentiation Correctness
Fernando Lucatelli Nunes, Matthijs Vákár
2022-10-25
Formal Languages and Automata Theory · Computer Science
On all things star-free
Thomas Place, Marc Zeitoun
2019-04-29
Formal Languages and Automata Theory · Computer Science
Non-closure under complementation for unambiguous linear grammars
Olga Martynova, Alexander Okhotin
2022-10-06
Group Theory · Mathematics
Finite presentability and isomorphism of Cayley graphs of monoids
J. Awang, M. Pfeiffer, N. Ruskuc
2016-10-18