Balanced-by-Construction Regular and ω-Regular Languages

Luc Edixhoven*, Sung-Shik Jongmans

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


Parenn is the typical generalization of the Dyck language to multiple types of parentheses. We generalize its notion of balancedness to allow parentheses of different types to freely commute. We show that balanced regular and ω-regular languages can be characterized by syntactic constraints on regular and ω-regular expressions and, using the shuffle on trajectories operator, we define grammars for balanced-by-construction expressions with which one can express every balanced regular and ω-regular language.
Original languageEnglish
Pages (from-to)117-144
Number of pages28
JournalInt. J. Found. Comput. Sci.
Issue number2&3
Publication statusPublished - Feb 2023


Dive into the research topics of 'Balanced-by-Construction Regular and ω-Regular Languages'. Together they form a unique fingerprint.

Cite this