Balanced-by-construction regular and -regular languages

DOI10.1007/978-3-030-81508-0_11OpenAlexW3192874140MaRDI QIDQ832929FDOQ832929

Authors: Luc Edixhoven, Sung-Shik Jongmans 

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_11

Recommendations

• scientific article; zbMATH DE number 2087485
• Balanced timed regular expressions
• scientific article; zbMATH DE number 148020
• On the balancedness of tree-to-word transducers
• Remarques sur les langages de parenthèses

zbMATH Keywords

regular languagesDyck languageshuffle on trajectories

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the enumeration and generation of generalized Dyck words
• Title not available (Why is that?)
• Shuffle on trajectories: Syntactic constraints
• Generalized Dyck paths
• Title not available (Why is that?)
• On a generalization of the Dyck-language over a two letter alphabet
• Lexicographical Generation of a Generalized Dyck Language
• A note on multidimensional Dyck languages

Cited In (2)

• Balanced-by-Construction Regular and ω-Regular Languages
• Title not available (Why is that?)

This page was built for publication: Balanced-by-construction regular and \(\omega \)-regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832929)