Balanced-by-Construction Regular and ω-Regular Languages
From MaRDI portal
Publication:6169961
DOI10.1142/s0129054122440026OpenAlexW4309730045MaRDI QIDQ6169961
Luc Edixhoven, Sung-Shik Jongmans
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122440026
Cites Work
- Generalized Dyck paths
- Balanced-by-construction regular and \(\omega \)-regular languages
- Shuffle on trajectories: Syntactic constraints
- On a generalization of the Dyck-language over a two letter alphabet
- On the enumeration and generation of generalized Dyck words
- A characterization of context-free languages
- Lexicographical Generation of a Generalized Dyck Language
- Contexts on trajectories
- A Note on Multidimensional Dyck Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Balanced-by-Construction Regular and ω-Regular Languages
