Publisher
Springer International Publishing
Reference9 articles.
1. Chomsky, N., Schützenberger, M.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, vol. 26, pp. 118–161. Elsevier (1959)
2. Duchon, P.: On the enumeration and generation of generalized Dyck words. Discret. Math. 225(1–3), 121–135 (2000). https://doi.org/10.1016/S0012-365X(00)00150-3
3. Edixhoven, L., Jongmans, S.S.: Balanced-by-construction regular and $$\omega $$-regular languages (technical report). Tech. Rep. OUNL-CS-2021-1, Open University of the Netherlands (2021)
4. Labelle, J., Yeh, Y.: Generalized Dyck paths. Discret. Math. 82(1), 1–6 (1990). https://doi.org/10.1016/0012-365X(90)90039-K
5. Liebehenschel, J.: Lexicographical generation of a generalized Dyck language. SIAM J. Comput. 32(4), 880–903 (2003). https://doi.org/10.1137/S0097539701394493
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balanced-by-Construction Regular and ω-Regular Languages;International Journal of Foundations of Computer Science;2022-11-22