no code implementations • 22 Dec 2020 • Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
A prominent problem of this kind is the position of the language $O_n$, the language that contains the same number of letters $a_i$ and $\bar a_i$ with $1\leq i\leq n$, in the known classes of formal languages.
Formal Languages and Automata Theory 68Q45, 20K15 F.4.3
