19 citations · 55 across the 13 of their papers we have counts for
1 paper · 1 filter
Galina Jirásková, Tomáš Masopust
The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial…